Metraipolis › archive › dc_15cf8df66ec5
HALO-LP: A Homogeneous All-Shifted Non-Interior-Point Method for Linear Programming — arXiv:2611.01038
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01038
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:44:24.317Z
- SHA-256 of the archived text
26acd456fffe70d96023dbd0cc442c50e06549befc92f0178be7e33e6167d98e- Stable URL of this page
https://metraipolis.com/documento/dc_15cf8df66ec5
How to cite
HALO-LP: A Homogeneous All-Shifted Non-Interior-Point Method for Linear Programming — arXiv:2611.01038 — arXiv (en), https://arxiv.org/abs/2611.01038 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_15cf8df66ec5 (Metraipolis archive dc_15cf8df66ec5, sha256 26acd456fffe70d96023dbd0cc442c50e06549befc92f0178be7e33e6167d98e)
BibTeX
@misc{dc15cf8df66ec5,
title = {HALO-LP: A Homogeneous All-Shifted Non-Interior-Point Method for Linear Programming — arXiv:2611.01038},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01038},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_15cf8df66ec5; sha256 26acd456fffe70d96023dbd0cc442c50e06549befc92f0178be7e33e6167d98e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01038. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This letter introduces HALO-LP, a novel homogeneous all-shifted non-interior-point method for linear programming (LP). The proposed method combines a homogeneous self-dual (HSD) embedding with all-shifted nonlinear complementarity (NCP) functions and proximal primal-dual regularization, enabling arbitrary primal-dual warm starts without requiring strictly interior iterates. The resulting Newton equations admit a condensation based on a positive-definite matrix that can be efficiently factorized using Cholesky decomposition, while the HSD embedding enables primal and dual infeasibility detection through Farkas certificates. Numerical evaluations on perturbed LP instances derived from the Netlib test set demonstrate state-of-the-art warm-starting performance, outperforming the competing solvers in the evaluated setting. We further validate optimality and infeasibility detection on analytically characterized LP problems. Finally, we demonstrate HALO-LP's applicability to robotic optimal control through sequential linear programming (SLP) for centroidal walking and trotting of quadrupedal robots. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.RO, nuovi lavori del giorno). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2611.01038 — 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:06:52.251Z dalla pagina https://arxiv.org/list/cs.RO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).