Metraipolis › archive › dc_0cedab1de63a
Vector Lyapunov functions for nonconvex constrained optimization — arXiv:2611.08729
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08729
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:42:28.705Z
- SHA-256 of the archived text
65956446504040f11f7216ced04281c7e463b3f2e89175f384ba524fd1be25f6- Stable URL of this page
https://metraipolis.com/documento/dc_0cedab1de63a
How to cite
Vector Lyapunov functions for nonconvex constrained optimization — arXiv:2611.08729 — arXiv (en), https://arxiv.org/abs/2611.08729 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0cedab1de63a (Metraipolis archive dc_0cedab1de63a, sha256 65956446504040f11f7216ced04281c7e463b3f2e89175f384ba524fd1be25f6)
BibTeX
@misc{dc0cedab1de63a,
title = {Vector Lyapunov functions for nonconvex constrained optimization — arXiv:2611.08729},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08729},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0cedab1de63a; sha256 65956446504040f11f7216ced04281c7e463b3f2e89175f384ba524fd1be25f6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08729. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Nonconvex constrained optimization problems are commonly solved by a Newton method for necessary conditions (sequential linear/quadratic programming) or a barrier reformulation (interior-point methods). We present a vector Lyapunov analysis for Newton-type algorithms based on constraint violation and optimality of the primal solutions to a sequence of approximate optimization problems. We thus prove local stability and convergence by constructing a strict Lyapunov function for the primal solution. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC) ; Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2611.08729 — 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.243Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).