Metraipolis › archive › dc_91ebc155ab7c

Exact penalty methods with adaptive discretization for nonsmooth semi-infinite optimization — arXiv:2611.03920

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03920
License (as archived)
CC0-1.0
Archived
2026-11-04T18:58:25.972Z
SHA-256 of the archived text
daa5406ff9d07f389c3a58897899241526d510cda387a9b2d650c093212f4c65
Stable URL of this page
https://metraipolis.com/documento/dc_91ebc155ab7c

How to cite

Exact penalty methods with adaptive discretization for nonsmooth semi-infinite optimization — arXiv:2611.03920 — arXiv (en), https://arxiv.org/abs/2611.03920 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_91ebc155ab7c (Metraipolis archive dc_91ebc155ab7c, sha256 daa5406ff9d07f389c3a58897899241526d510cda387a9b2d650c093212f4c65)
BibTeX
@misc{dc91ebc155ab7c,
  title = {Exact penalty methods with adaptive discretization for nonsmooth semi-infinite optimization — arXiv:2611.03920},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03920},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_91ebc155ab7c; sha256 daa5406ff9d07f389c3a58897899241526d510cda387a9b2d650c093212f4c65},
  year = {2026}
}

Archived text

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

The paper considers a nonsmooth semi-infinite optimization problem in which the constraints are reformulated through a value function. Stationary points of the cutting surface approximations are studied, showing that stationarity is preserved in the limit under boundedness of the associated sequence of multipliers. Building on these results, an algorithm that combines the cutting surface approximations with a penalty scheme is devised, together with some proximal variants. An exact penalty result is established under suitable global conditions, and numerical results are reported to compare the methods with existing exact penalty and cutting surface algorithms.

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