Metraipolis › archive › dc_82dd9932cb80
A true single-level reformulation for pessimistic bilevel optimization — arXiv:2609.38014
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.38014
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:02:13.564Z
- SHA-256 of the archived text
5d272b70da9f72b8e86abf73a177d3cea4b23e913d17c7b3a68f8e9ae6f9d19d- Stable URL of this page
https://metraipolis.com/documento/dc_82dd9932cb80
How to cite
A true single-level reformulation for pessimistic bilevel optimization — arXiv:2609.38014 — arXiv (en), https://arxiv.org/abs/2609.38014 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_82dd9932cb80 (Metraipolis archive dc_82dd9932cb80, sha256 5d272b70da9f72b8e86abf73a177d3cea4b23e913d17c7b3a68f8e9ae6f9d19d)
BibTeX
@misc{dc82dd9932cb80,
title = {A true single-level reformulation for pessimistic bilevel optimization — arXiv:2609.38014},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.38014},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_82dd9932cb80; sha256 5d272b70da9f72b8e86abf73a177d3cea4b23e913d17c7b3a68f8e9ae6f9d19d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38014. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We propose a single-level reformulation (SLR) for the pessimistic bilevel optimization problem that does not rely on complementarity conditions or optimal value functions. For this reason, we refer to it as a true single-level reformulation (tSLR). A remarkable consequence is that this reformulation can satisfy the classical linear independence constraint qualification, despite the fact that even the weaker Mangasarian-Fromovitz constraint qualification is known to systematically fail for standard single-level reformulations of both optimistic and pessimistic bilevel programs. We leverage on these constraint qualifications to construct new necessary optimality conditions for pessimistic bilevel optimization. The reformulation also has a striking limitation: under the assumptions of our analysis, the classical second-order sufficient condition fails at every Karush-Kuhn-Tucker point of the problem. Nevertheless, preliminary numerical experiments demonstrate that algorithms based on the proposed tSLR can outperform existing approaches for pessimistic bilevel optimization. Overall, the proposed framework suggests that pessimistic bilevel programs may be considerably more tractable than previously believed and need not be inherently more difficult to solve than their optimistic counterparts. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.OC). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2609.38014 — 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-07T17:35:03.572Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).