Geometric and computational hardness of bilevel programming
Authors:
- 29 April 2025
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 215 (1-2) , 539-574
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Agence Nationale de la Recherche (ANR-19-PI3A0004)
- Agence Nationale de la Recherche (ANR-17-EURE-0010)
- Agence Nationale de la Recherche (ANR-23-CE23-0012-01)
- Air Force Materiel Command (FA8655-22-1-7012)
This publication has 27 references indexed in Scilit:
- A survey on bilevel optimization under uncertaintyEuropean Journal of Operational Research, 2023
- A robust approach for modeling limited observability in bilevel optimizationOperations Research Letters, 2021
- Bilevel Optimization and Variational Analysis2020
- An Introduction to Differential Manifolds2015
- On solving simple bilevel programs with a nonconvex lower level programMathematical Programming, 2013
- Algorithms in Real Algebraic Geometry2006
- Semidefinite programming relaxations for semialgebraic problemsMathematical Programming, 2003
- Some properties of the bilevel programming problemJournal of Optimization Theory and Applications, 1991
- The polynomial hierarchy and a simple model for competitive analysisMathematical Programming, 1985
- The polynomial-time hierarchyTheoretical Computer Science, 1976