Metraipolis › archive › dc_e7ead8c8a510

A stabilized sequential quadratic programming method for degenerate nonlinear optimization problems on Riemannian manifolds — arXiv:2608.13298

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.13298
License (as archived)
CC0-1.0
Archived
2026-10-19T04:46:27.184Z
SHA-256 of the archived text
27bdf1802cd4728604565b1ed3d21adfa63b97ed19206694f86d2264170ce4a5
Stable URL of this page
https://metraipolis.com/documento/dc_e7ead8c8a510

How to cite

A stabilized sequential quadratic programming method for degenerate nonlinear optimization problems on Riemannian manifolds — arXiv:2608.13298 — arXiv (en), https://arxiv.org/abs/2608.13298 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e7ead8c8a510 (Metraipolis archive dc_e7ead8c8a510, sha256 27bdf1802cd4728604565b1ed3d21adfa63b97ed19206694f86d2264170ce4a5)
BibTeX
@misc{dce7ead8c8a510,
  title = {A stabilized sequential quadratic programming method for degenerate nonlinear optimization problems on Riemannian manifolds — arXiv:2608.13298},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.13298},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e7ead8c8a510; sha256 27bdf1802cd4728604565b1ed3d21adfa63b97ed19206694f86d2264170ce4a5},
  year = {2026}
}

Archived text

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

We propose a stabilized sequential quadratic programming (SQP) method for degenerate constrained optimization problems on Riemannian manifolds. The problem considered in this study is a Riemannian nonlinear programming problem (RNLP) with equality and inequality constraints, where classical constraint qualifications may fail. While existing Riemannian SQP methods guarantee global convergence only under constraint qualifications, their convergence behavior is not ensured for degenerate problems. To address this limitation, we extend the stabilized SQP framework from Euclidean spaces to Riemannian manifolds. Without assuming any constraint qualification, we prove that the generated sequence has an accumulation point that is a Karush--Kuhn--Tucker (KKT) point, an approximate KKT (AKKT) point, or a stationary point of an associated feasibility problem. Finally, we conduct numerical experiments to confirm the effectiveness of the proposed method for degenerate problems.

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