Metraipolis › archive › dc_4bd77dc9edd0
Recent Developments in HPR Methods for Large-Scale Convex Composite Quadratic Programming — arXiv:2611.01887
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01887
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:32:16.844Z
- SHA-256 of the archived text
1bc8870fd993024fe4214af36a824ac1b954c0fb279c112adc68f597a9a46f52- Stable URL of this page
https://metraipolis.com/documento/dc_4bd77dc9edd0
How to cite
Recent Developments in HPR Methods for Large-Scale Convex Composite Quadratic Programming — arXiv:2611.01887 — arXiv (en), https://arxiv.org/abs/2611.01887 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4bd77dc9edd0 (Metraipolis archive dc_4bd77dc9edd0, sha256 1bc8870fd993024fe4214af36a824ac1b954c0fb279c112adc68f597a9a46f52)
BibTeX
@misc{dc4bd77dc9edd0,
title = {Recent Developments in HPR Methods for Large-Scale Convex Composite Quadratic Programming — arXiv:2611.01887},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01887},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4bd77dc9edd0; sha256 1bc8870fd993024fe4214af36a824ac1b954c0fb279c112adc68f597a9a46f52},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01887. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present recent developments in Halpern Peaceman--Rachford (HPR) methods for solving large-scale convex composite quadratic programming problems. Within a unified HPR framework applied to the restricted Wolfe dual, we develop several algorithmic variants based on different choices of the semi-proximal operator $\mathcal{T}_1$ for the joint dual subproblem. Specifically, an sGS-based construction leads to a sequential $w$--$y$--$w$ update scheme, while a block-linearized construction eliminates cross-block coupling and enables parallel dual updates. To improve the latter, we further introduce a coupling-aware construction that exploits a second spectral moment to obtain a tighter row majorizer. We extend the framework to convex quadratically constrained quadratic programming through factor-based second-order cone reformulations. Additional computational enhancements include equality Gram scaling and asynchronous CPU polishing. We establish convergence results under fixed metrics and discuss practical adaptive strategies.
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.01887 — 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-03T11:04:22.249Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).