Metraipolis › archive › dc_5690fe8a9d88

A Smooth Equality Reformulation of Nonlinear Exponential Cone Optimization — arXiv:2611.09108

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.09108
License (as archived)
CC0-1.0
Archived
2026-11-09T22:42:30.153Z
SHA-256 of the archived text
65815cb9654494011cce38a26f069f1a5ecefdd10b5c422a3005cf36b918ae92
Stable URL of this page
https://metraipolis.com/documento/dc_5690fe8a9d88

How to cite

A Smooth Equality Reformulation of Nonlinear Exponential Cone Optimization — arXiv:2611.09108 — arXiv (en), https://arxiv.org/abs/2611.09108 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5690fe8a9d88 (Metraipolis archive dc_5690fe8a9d88, sha256 65815cb9654494011cce38a26f069f1a5ecefdd10b5c422a3005cf36b918ae92)
BibTeX
@misc{dc5690fe8a9d88,
  title = {A Smooth Equality Reformulation of Nonlinear Exponential Cone Optimization — arXiv:2611.09108},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.09108},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5690fe8a9d88; sha256 65815cb9654494011cce38a26f069f1a5ecefdd10b5c422a3005cf36b918ae92},
  year = {2026}
}

Archived text

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

Exponential cone optimization has received considerable attention in the modern literature, but studies involving nonlinear objective and constraint functions are still limited. This work can be seen as one of the first steps toward understanding nonlinear exponential cone optimization (NECO) problems. Here, we ask the question "Can smooth equality constraints replace nonlinear exponential cone constraints?". From a practical point of view, even squared slack reformulations in nonlinear programming introduce difficulties. However, such reformulations can be useful for studying optimality conditions. Motivated by this observation, in this work, we use a smooth surjective parameterization of the exponential cone to reformulate NECO as an equality-constrained nonlinear program (RNLP). We then analyze Karush-Kuhn-Tucker (KKT) and second-order optimality conditions for NECO through RNLP. Although feasibility is represented exactly, the KKT conditions for RNLP do not in general guarantee those for NECO. We characterize this correspondence through multiplier restrictions that are equivalent to a second-order condition involving only slack variables. We also establish an exact curvature identity showing that RNLP reproduces the sigma term of NECO without additional assumptions. Finally, we prove the relationships between second-order necessary and sufficient conditions for the two problems. We identify when RNLP can be used to rule out local minimizers of NECO or establish strict local optimality for NECO without explicitly evaluating the sigma term.

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.09108 — 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-09T22:35:32.248Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).