Metraipolis › archive › dc_9b45f12dcd68
An Exact Dual for Second-Order Cone Programming Using Only Lorentz-Cone Constraints — arXiv:2609.06757
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06757
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:29:32.432Z
- SHA-256 of the archived text
84412c31fd2f3232e57b7d2a4bcbcd3eadf86cbef46b89de3dd79d93849f3db8- Stable URL of this page
https://metraipolis.com/documento/dc_9b45f12dcd68
How to cite
An Exact Dual for Second-Order Cone Programming Using Only Lorentz-Cone Constraints — arXiv:2609.06757 — arXiv (en), https://arxiv.org/abs/2609.06757 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9b45f12dcd68 (Metraipolis archive dc_9b45f12dcd68, sha256 84412c31fd2f3232e57b7d2a4bcbcd3eadf86cbef46b89de3dd79d93849f3db8)
BibTeX
@misc{dc9b45f12dcd68,
title = {An Exact Dual for Second-Order Cone Programming Using Only Lorentz-Cone Constraints — arXiv:2609.06757},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06757},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9b45f12dcd68; sha256 84412c31fd2f3232e57b7d2a4bcbcd3eadf86cbef46b89de3dd79d93849f3db8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06757. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Without a constraint qualification, second-order cone programs can have a duality gap or an unattained dual value. For every such program with arbitrary real coefficients, we construct an exact dual using only affine equations and memberships in products of Lorentz cones. Every feasible dual point gives a valid bound. Whenever the primal is feasible with finite value, the dual attains that value. This answers a question raised by Pólik and Terlaky and reiterated in subsequent work: whether an exact dual for second-order cone programming can use only Lorentz-cone constraints. The same construction produces an affine second-order cone system that is feasible exactly when a given affine second-order cone system is infeasible, including in the weakly infeasible case. Both formulations have polynomial size and are obtained uniformly from the input coefficients using only fixed rational constants. These are formulation-size results over exact real data; they do not imply polynomial-time solvability or polynomial bounds on the bit length of rational certificates. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.OC). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2609.06757 — 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-16T14:09:21.676Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).