Mixed-integer bilevel optimization with nonconvex quadratic lower-level problems: complexity and a solution method

DOI10.1007/S10898-025-01522-4MaRDI QIDQ6921142zbMATH OpenFDO

Authors Immanuel M. Bomze, Andreas Horländer, Martin Hühne

Publication date 6 October 2025

Published in Journal of Global Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10898-025-01522-4

zbMATH Keywords

bilevel optimizationcomplexitymixed integer optimizationnonconvex lower levels

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Quadratic programming (90C20) Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Cites work

• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• A general regularized continuous formulation for the maximum clique problem
• A study on the computational complexity of the bilevel knapsack problem
• A survey on bilevel optimization under uncertainty
• A survey on mixed-integer programming techniques in bilevel optimization
• A value-function-based exact approach for the bilevel mixed-integer programming problem
• An exact method for nonlinear network flow interdiction problems
• Bilevel programming and price setting problems
• Bilevel programming problems. Theory, algorithms and applications to energy networks
• Bilevel programming with knapsack constraints
• 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
• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
• Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
• Evolution towards the maximum clique
• Foundations of bilevel programming
• Global solution of bilevel programs with a nonconvex inner program
• Global solution of nonlinear mixed-integer bilevel programs
• Infinitely constrained optimization problems
• Integer Programming
• Introduction to Nonlinear Optimization: Theory, Algorithms, and Applications with Python and MATLAB, Second Edition
• Maxima for Graphs and a New Proof of a Theorem of Turán
• New Branch-and-Bound Rules for Linear Bilevel Programming
• On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
• On the use of intersection cuts for bilevel optimization
• Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
• Outer approximation for global optimization of mixed-integer quadratic bilevel problems
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
• The polynomial hierarchy and a simple model for competitive analysis
• Why there is no need to use a big-M in linear bilevel optimization: a computational study of two ready-to-use approaches

Cited in

(1)

• Data-driven interdiction with asymmetric cost uncertainty: a distributionally robust optimization approach

This page was built for publication: Mixed-integer bilevel optimization with nonconvex quadratic lower-level problems: complexity and a solution method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6921142)