Metraipolis › archive › dc_17f2d034faf9
A Parallel Adaptive Proximal ADMM for Linearly Constrained Separable Composite Optimization Problems — arXiv:2611.00570
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00570
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:44:45.933Z
- SHA-256 of the archived text
1eddd9c446ef4379a27a78ef2e46c1a68e14640d763d4e2630c39d49e1f3e159- Stable URL of this page
https://metraipolis.com/documento/dc_17f2d034faf9
How to cite
A Parallel Adaptive Proximal ADMM for Linearly Constrained Separable Composite Optimization Problems — arXiv:2611.00570 — arXiv (en), https://arxiv.org/abs/2611.00570 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_17f2d034faf9 (Metraipolis archive dc_17f2d034faf9, sha256 1eddd9c446ef4379a27a78ef2e46c1a68e14640d763d4e2630c39d49e1f3e159)
BibTeX
@misc{dc17f2d034faf9,
title = {A Parallel Adaptive Proximal ADMM for Linearly Constrained Separable Composite Optimization Problems — arXiv:2611.00570},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00570},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_17f2d034faf9; sha256 1eddd9c446ef4379a27a78ef2e46c1a68e14640d763d4e2630c39d49e1f3e159},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00570. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We propose and analyze an adaptive proximal alternating direction method of multipliers (ADMM), based on Jacobi-type updates, for linearly constrained separable nonconvex composite optimization problems. The objective consists of two block-separable functions, one continuously differentiable and weakly convex, and the other convex and Lipschitz continuous. The proposed method is adaptive to all problem parameters and allows inexact solutions of the block proximal subproblems. At each iteration, we solve all block subproblems in parallel, then apply a novel test to decide whether to update the Lagrange multiplier and/or the penalty parameter. Without any rank assumptions on the constraint matrices, we establish an ${\cal O}(\epsilon^{-3})$ iteration-complexity bound for obtaining an approximate first-order stationary point. This matches the best-known complexity for cyclic proximal ADMM methods and improves the existing complexity of Jacobi-type schemes in this general nonconvex setting. Numerical experiments on a nonconvex quadratic program illustrate the proposed method's computational benefits.
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/2611.00570 — 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-03T18:14:37.744Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).