Metraipolis › archive › dc_24ec3ead8859
Variable Metric Three Operator Splitting — arXiv:2610.38935
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.38935
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:32:09.765Z
- SHA-256 of the archived text
ea9ea5d75291019b079abb03119df45c58b2d4b68c30563f8a899aff8b831f16- Stable URL of this page
https://metraipolis.com/documento/dc_24ec3ead8859
How to cite
Variable Metric Three Operator Splitting — arXiv:2610.38935 — arXiv (en), https://arxiv.org/abs/2610.38935 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_24ec3ead8859 (Metraipolis archive dc_24ec3ead8859, sha256 ea9ea5d75291019b079abb03119df45c58b2d4b68c30563f8a899aff8b831f16)
BibTeX
@misc{dc24ec3ead8859,
title = {Variable Metric Three Operator Splitting — arXiv:2610.38935},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.38935},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_24ec3ead8859; sha256 ea9ea5d75291019b079abb03119df45c58b2d4b68c30563f8a899aff8b831f16},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38935. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
To minimize the sum $f + g + h$ of three convex functions when $f$ is differentiable with a Lipschitz-continuous gradient, we present a proximal algorithm, variable-metric three operator splitting (VMTOS), a generalization of the three operator splitting (TOS) scheme of Davis and Yin. We establish convergence guarantees by controlling changes in the metric. The smallest saddle-point residual among the first $k$ primal-dual iterates is $\tilde{O}(k^{-1/2})$. When $f$ and the convex conjugate $h^*$ are strongly convex and the accepted metrics and their inverses are uniformly bounded, the rate improves to $\tilde{O}(\beta^k)$ for some $\beta \in (0,1)$. We develop a practical Barzilai--Borwein update for diagonal metrics that satisfies our bound on metric changes. Under the same strong convexity assumptions, this update guarantees the required uniform metric bounds, yielding R-linear convergence. Numerical experiments on benchmark optimization problems show that VMTOS is competitive with other proximal algorithms.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.38935 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:14:28.309Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).