Metraipolis › archive › dc_f68771cd4da7

Applications of the Lorentz positive cone in nonconvex quadratic optimization — arXiv:2609.32017

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.32017
License (as archived)
CC0-1.0
Archived
2026-10-07T23:04:22.367Z
SHA-256 of the archived text
180ce6ec092f6408de47607c5a1627663fe30e39a0e27ed4aba8a6f3b0ee2be2
Stable URL of this page
https://metraipolis.com/documento/dc_f68771cd4da7

How to cite

Applications of the Lorentz positive cone in nonconvex quadratic optimization — arXiv:2609.32017 — arXiv (en), https://arxiv.org/abs/2609.32017 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f68771cd4da7 (Metraipolis archive dc_f68771cd4da7, sha256 180ce6ec092f6408de47607c5a1627663fe30e39a0e27ed4aba8a6f3b0ee2be2)
BibTeX
@misc{dcf68771cd4da7,
  title = {Applications of the Lorentz positive cone in nonconvex quadratic optimization — arXiv:2609.32017},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.32017},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f68771cd4da7; sha256 180ce6ec092f6408de47607c5a1627663fe30e39a0e27ed4aba8a6f3b0ee2be2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.32017. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We consider the Lorentz positive cone of $n\times m$ matrices that map the Lorentz cone in $\Rbb^m$ into the Lorentz cone in $\Rbb^n$. The Lorentz positive cone and its dual, the cone of Lorentz separable matrices, are shown to provide polynomial-time algorithms for the problem of minimizing a bilinear objective over variables contained in ellipsoids in $\Rbb^n$ and $\Rbb^m$. We also demonstrate how these cones can be used to strengthen SDP relaxations of other nonconvex quadratic optimization problems, including the two-trust-region subproblem.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.32017 — 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-07T22:42:39.173Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).