Metraipolis › archive › dc_70fa66f63eff

On error bounds and noncritical Lagrange multipliers — arXiv:2610.11491

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.11491
License (as archived)
CC0-1.0
Archived
2026-10-09T06:28:03.187Z
SHA-256 of the archived text
3d669e51ac68d3ba0e03ba02aab6707fc419c19d4ec76f5cafdb29b046dd23df
Stable URL of this page
https://metraipolis.com/documento/dc_70fa66f63eff

How to cite

On error bounds and noncritical Lagrange multipliers — arXiv:2610.11491 — arXiv (en), https://arxiv.org/abs/2610.11491 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_70fa66f63eff (Metraipolis archive dc_70fa66f63eff, sha256 3d669e51ac68d3ba0e03ba02aab6707fc419c19d4ec76f5cafdb29b046dd23df)
BibTeX
@misc{dc70fa66f63eff,
  title = {On error bounds and noncritical Lagrange multipliers — arXiv:2610.11491},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.11491},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_70fa66f63eff; sha256 3d669e51ac68d3ba0e03ba02aab6707fc419c19d4ec76f5cafdb29b046dd23df},
  year = {2026}
}

Archived text

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

Critical Lagrange multipliers are known to be responsible for the potentially slow convergence of Newton-type methods, and noncriticality of a given multiplier has been tied to an error bound which estimates the distance of a primal-dual pair associated with a perturbed problem to the primal solution and the multiplier set of the unperturbed one, and is decisive for a local convergence analysis. We investigate this relation in an abstract setting where merely a set-valued mapping assigning primal-dual pairs to a parameter is available, and characterize the error bound of interest in terms of noncriticality of the underlying multiplier and two calmness-type properties of the associated multiplier mapping, one of which is a novel weak inner calmness in the fuzzy sense. No structural assumptions on the underlying problem are needed for that, and the two calmness-type conditions are not only sufficient but also necessary. Afterwards, we specify these findings for composite optimization problems. Whenever the subdifferential of the outer function is a polyhedral mapping, both conditions hold automatically, which explains the equivalence of noncriticality and the error bound observed in the polyhedral setting. Whenever the outer function is $C^2$-decomposable, they are secured by calmness of a restricted multiplier mapping together with a closedness condition, which recovers and extends the known characterization for $C^2$-cone reducible constraint systems.

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/2610.11491 — 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-09T05:52:31.597Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).