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
- Vũ Xuân Nhâm
- Cong Bang Vu
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