On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
From MaRDI portal
Publication:6163957
DOI10.1007/s10957-023-02238-9arXiv2202.01033OpenAlexW4378619654MaRDI QIDQ6163957
Martin Schmidt, Yasmine Beck, Johannes Thürauf, Bienstock, Daniel
Publication date: 26 July 2023
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.01033
Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Global solution of bilevel programs with a nonconvex inner program
- Foundations of bilevel programming
- On the use of intersection cuts for bilevel optimization
- Global solution of nonlinear mixed-integer bilevel programs
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
- Exact solutions to linear programming problems
- Integer Programming
- New Branch-and-Bound Rules for Linear Bilevel Programming
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Bilevel Linear Optimization Under Uncertainty
- Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization
- Complexity, exactness, and rationality in polynomial optimization
- A survey on bilevel optimization under uncertainty
- A survey on mixed-integer programming techniques in bilevel optimization
This page was built for publication: On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
