Metraipolis › archive › dc_c3457aeb47d2

A constraint dissolving inexact penalty method for optimization problems with geometric constraints — arXiv:2608.24542

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.24542
License (as archived)
CC0-1.0
Archived
2026-10-18T06:46:28.744Z
SHA-256 of the archived text
c06ea2c6b19f01e33435e2f69626112d7bac28d44d485d9dd6dc80c12add0834
Stable URL of this page
https://metraipolis.com/documento/dc_c3457aeb47d2

How to cite

A constraint dissolving inexact penalty method for optimization problems with geometric constraints — arXiv:2608.24542 — arXiv (en), https://arxiv.org/abs/2608.24542 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c3457aeb47d2 (Metraipolis archive dc_c3457aeb47d2, sha256 c06ea2c6b19f01e33435e2f69626112d7bac28d44d485d9dd6dc80c12add0834)
BibTeX
@misc{dcc3457aeb47d2,
  title = {A constraint dissolving inexact penalty method for optimization problems with geometric constraints — arXiv:2608.24542},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.24542},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c3457aeb47d2; sha256 c06ea2c6b19f01e33435e2f69626112d7bac28d44d485d9dd6dc80c12add0834},
  year = {2026}
}

Archived text

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

Optimization problems with geometric constraints have a broad range of applications, including machine learning, finance, and control. A powerful algorithmic tool to resolve these geometric constraints are constraint dissolving methods. To this end, we propose a framework for constraint dissolving mappings for nonconvex geometric constraints. Leveraging these, we develop a constraint dissolving inexact penalty method to solve optimization problems with general set-membership constraints and possibly nonconvex geometric constraints. We establish the convergence of the proposed algorithm and prove that every feasible accumulation point is Mordukhovich stationary. Notably, we rely only on mild asymptotic Mordukhovich regularity, which is significantly weaker than the constraint qualifications adopted in the existing literature on constraint dissolving methods. Numerical experiments addressing classical equality-, complementarity-, sparsity-, and low-rank constrained optimization problems demonstrate that the proposed method is competitive with the safeguarded augmented Lagrangian method in terms of solution quality and significantly outperforms the penalty decomposition method.

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