Paperlane

no. 17 · Wednesday 18 November 2026

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

Cong Bang Vu and Xuan Nham Vu

math.OC · 19 pp

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.

comments
19 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.23100 ↗