An algorithm for solving structured problems involving $L$-infimal convolutions

We develop an operator-splitting framework for solving structured minimization problems involving linear compositions of $L$-infimal convolutions. We introduce a primal-dual shadow Douglas-Rachford splitting method and establish its convergence. As a result, we derive a fully primal-dual splitting algorithm for the class of the aforementioned minimization problems.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-17
DOI
https://doi.org/10.48550/arxiv.2611.23100
Primary Topic
Optimization and Variational Analysis
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

An algorithm for solving structured problems involving $L$-infimal convolutions

Vũ Xuân Nhâm, Cong Bang Vu
arXiv (Cornell University)
Optimization and Variational Analysis
preprint

An algorithm for solving structured problems involving $L$-infimal convolutions

Vũ Xuân Nhâm, Cong Bang Vu
preprint en

Abstract

We develop an operator-splitting framework for solving structured minimization problems involving linear compositions of $L$-infimal convolutions. We introduce a primal-dual shadow Douglas-Rachford splitting method and establish its convergence. As a result, we derive a fully primal-dual splitting algorithm for the class of the aforementioned minimization problems.

arXiv (Cornell University)
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon