Metraipolis › archive › dc_25f1092a52da
Restarted Fixed-Point Acceleration of Proximal ADMM for Capped-$\ell_1$ Penalized Optimization — arXiv:2610.21444
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.21444
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:28:33.151Z
- SHA-256 of the archived text
557e7e67c163ec890783b2674fb042ef3e196a1003d90608b77a21498dd5dd0f- Stable URL of this page
https://metraipolis.com/documento/dc_25f1092a52da
How to cite
Restarted Fixed-Point Acceleration of Proximal ADMM for Capped-$\ell_1$ Penalized Optimization — arXiv:2610.21444 — arXiv (en), https://arxiv.org/abs/2610.21444 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_25f1092a52da (Metraipolis archive dc_25f1092a52da, sha256 557e7e67c163ec890783b2674fb042ef3e196a1003d90608b77a21498dd5dd0f)
BibTeX
@misc{dc25f1092a52da,
title = {Restarted Fixed-Point Acceleration of Proximal ADMM for Capped-$ell_1$ Penalized Optimization — arXiv:2610.21444},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.21444},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_25f1092a52da; sha256 557e7e67c163ec890783b2674fb042ef3e196a1003d90608b77a21498dd5dd0f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21444. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider box-constrained optimization with a convex, Lipschitz continuous loss function that may be nonsmooth and a capped-$\ell_1$ penalty. Exploiting the convex branch representation of the capped-$\ell_1$ penalty, we construct an associated nonexpansive fixed-point mapping for each branch and, based on these mappings, propose a restarted accelerated proximal alternating direction method of multipliers (RA-pADMM). The resulting algorithm consists of a preliminary branch identification phase and a subsequent accelerated phase based on either the Halpern or fast Krasnosel'skiĭ--Mann iteration, together with a sufficient decrease restart mechanism. We prove that the preliminary phase terminates after finitely many iterations and that only finitely many branch updates are accepted during the subsequent phase. The primal iterates and proximal outputs converge to a common lifted stationary point, which is also a $\nu$-strong local minimizer of the corresponding cardinality penalized problem. Moreover, the Halpern and fast Krasnosel'skiĭ--Mann variants achieve nonergodic $O(k^{-1})$ and asymptotic $o(k^{-1})$ convergence rates, respectively, for both the objective value gap and the Karush--Kuhn--Tucker residual associated with the final branch. Numerical experiments on sparse recovery and real data classification problems demonstrate the effectiveness of the proposed RA-pADMM algorithm.
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.21444 — 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-10-16T08:49:47.923Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).