Robust bilevel optimization for near-optimal lower-level solutions
DOI10.1007/S10898-024-01422-ZMaRDI QIDQ6635807FDOQ6635807
Authors: Mathieu Besançon, Miguel F. Anjos, L. Brotcorne 
Publication date: 12 November 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Recommendations
- Uncertainty handling in bilevel optimization for robust and reliable solutions
- Complexity of near-optimal robust versions of multilevel optimization problems
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Foundations of bilevel programming
- Bilevel derivative-free optimization and its application to robust optimization
bilevel optimizationdualityrobust optimizationbounded rationalityextended formulationbilinear constraintsdecision-dependent uncertainty
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Semi-infinite programming (90C34) Hierarchical games (including Stackelberg games) (91A65)
Cites Work
- Julia: a fresh approach to numerical computing
- JuMP: a modeling language for mathematical optimization
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of bilevel programming
- Weak via strong Stackelberg problem: New results
- Recent advances in robust optimization: an overview
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Title not available (Why is that?)
- Pessimistic bilevel optimization
- An SOS1-based approach for solving MPECs with a natural gas market application
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Methods for Global Concave Minimization: A Bibliographic Survey
- A class of stochastic programs with decision dependent uncertainty
- Robust game theory
- Generalized semi-infinite programming: Theory and methods
- On mathematical programming with indicator constraints
- Disjunctive cuts for continuous linear bilevel programming
- Robust solutions to Stackelberg games: addressing bounded rationality and limited observations in human cognition
- Complexity of near-optimal robust versions of multilevel optimization problems
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- Title not available (Why is that?)
- The Benders decomposition algorithm: a literature review
- Robust Wardrop Equilibrium
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Decision rule bounds for two-stage stochastic bilevel programs
- Computing feasible points for binary MINLPs with MPECs
- On a class of bilevel linear mixed-integer programs in adversarial settings
- Title not available (Why is that?)
- On bilevel optimization with inexact follower
- Technical note -- There's no free lunch: on the hardness of choosing a correct big-\(M\) in bilevel optimization
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- On the complexity of robust bilevel optimization with uncertain follower's objective
- A robust approach for modeling limited observability in bilevel optimization
- Computing locally optimal solutions of the Bilevel Optimization problem using the KKT approach
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- A survey on bilevel optimization under uncertainty
This page was built for publication: Robust bilevel optimization for near-optimal lower-level solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635807)
