Metraipolis › archive › dc_23ef0b751ac3

A constraint dissolving method for generally constrained optimization over a nonconvex set — arXiv:2611.04954

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04954
License (as archived)
CC0-1.0
Archived
2026-11-04T12:45:19.640Z
SHA-256 of the archived text
7666ed1e5feb182e2efbd87a3405935026316f4b59ef144ad9dda4f88f036d7f
Stable URL of this page
https://metraipolis.com/documento/dc_23ef0b751ac3

How to cite

A constraint dissolving method for generally constrained optimization over a nonconvex set — arXiv:2611.04954 — arXiv (en), https://arxiv.org/abs/2611.04954 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_23ef0b751ac3 (Metraipolis archive dc_23ef0b751ac3, sha256 7666ed1e5feb182e2efbd87a3405935026316f4b59ef144ad9dda4f88f036d7f)
BibTeX
@misc{dc23ef0b751ac3,
  title = {A constraint dissolving method for generally constrained optimization over a nonconvex set — arXiv:2611.04954},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04954},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_23ef0b751ac3; sha256 7666ed1e5feb182e2efbd87a3405935026316f4b59ef144ad9dda4f88f036d7f},
  year = {2026}
}

Archived text

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

This manuscript studies a constraint dissolving method for solving optimization problems with general constraints, comprising an abstract constraint G(x) \in C and a potentially nonconvex geometric constraint x \in D, which, to the best of our knowledge, is the first constraint dissolving type method applicable to this general setting. More specifically, we introduce an auxiliary variable s to decouple G(x) \in C into G(x) = s and s \in C, and construct the constraint dissolving mapping acting jointly on both variables. We then propose a penalty-based constraint dissolving method, in which the penalty parameter is updated adaptively according to the feasibility error. Under mild conditions, every accumulation point is Mordukhovich-stationary. By a specific choice of the constraint dissolving mapping, every accumulation point is guaranteed to be feasible, which stands in contrast to standard penalty-type methods in nonconvex settings. Numerical experiments on Rosenbrock, portfolio, and MAXCUT problems demonstrate the effectiveness of the proposed method against the augmented Lagrangian and the penalty decomposition methods.

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.04954 — 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-04T12:31:32.258Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).