Metraipolis › archive › dc_8cfd9fd3da8e
Recent Developments in HPR Methods for Large-Scale Linear Programming — arXiv:2611.01872
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01872
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:45:31.537Z
- SHA-256 of the archived text
ee754a7546b299e79a110ae6e4c6b79e56c7a93be14a0a57e6ffa45e358c3918- Stable URL of this page
https://metraipolis.com/documento/dc_8cfd9fd3da8e
How to cite
Recent Developments in HPR Methods for Large-Scale Linear Programming — arXiv:2611.01872 — arXiv (en), https://arxiv.org/abs/2611.01872 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8cfd9fd3da8e (Metraipolis archive dc_8cfd9fd3da8e, sha256 ee754a7546b299e79a110ae6e4c6b79e56c7a93be14a0a57e6ffa45e358c3918)
BibTeX
@misc{dc8cfd9fd3da8e,
title = {Recent Developments in HPR Methods for Large-Scale Linear Programming — arXiv:2611.01872},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01872},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8cfd9fd3da8e; sha256 ee754a7546b299e79a110ae6e4c6b79e56c7a93be14a0a57e6ffa45e358c3918},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01872. 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 linear programming problems. We first introduce the semi-proximal HPR framework and summarize its convergence guarantees, together with its connections to Halpern PDHG and ergodic Peaceman-Rachford iterations. To improve practical performance, we develop adaptive restart and penalty parameter update strategies. We then describe several computational enhancements, including GPU-based preprocessing, diagonal scaling, reusable execution plans for sparse matrix-vector multiplication, and sieving techniques. We further discuss multi-GPU parallelization and lossless model storage and loading for handling large-scale instances. These developments form the foundation of HPR-LP, a GPU-accelerated solver for large-scale linear programming. 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.01872 — 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.770Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).