On the solution of convex bilevel optimization problems
From MaRDI portal
Publication:263155
DOI10.1007/s10589-015-9795-8zbMath1343.90065OpenAlexW2157894832MaRDI QIDQ263155
Publication date: 4 April 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9795-8
bilevel programmingKKT-transformationmathematical programs with equilibrium constraintsoptimal value transformationsolution algorithm
Nonconvex programming, global optimization (90C26) Hierarchical games (including Stackelberg games) (91A65)
Related Items
Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming ⋮ Analysis and Solution Methods for Bilevel Optimal Control Problems ⋮ Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments ⋮ Bilevel Optimization: Reformulation and First Optimality Conditions ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ A bridge between bilevel programs and Nash games ⋮ Numerically tractable optimistic bilevel problems ⋮ Bilevel Polynomial Programs and Semidefinite Relaxation Methods ⋮ Convergences for robust bilevel polynomial programmes with applications ⋮ Solving inverse optimal control problems via value functions to global optimality ⋮ Discriminatively learned hierarchical rank pooling networks ⋮ A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem ⋮ A primal nonsmooth reformulation for bilevel optimization problems ⋮ Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem ⋮ Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation ⋮ Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization ⋮ Solution of bilevel optimization problems using the KKT approach ⋮ MPEC Methods for Bilevel Optimization Problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On local search in d.c. optimization problems
- Solution algorithm for an optimistic linear Stackelberg problem
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Generalized semi-infinite programming: The symmetric reduction ansatz
- Global solution of bilevel programs with a nonconvex inner program
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Practical bilevel optimization. Algorithms and applications
- Links between linear bilevel and mixed 0-1 programming problems
- Bi-level strategies in semi-infinite programming.
- Foundations of bilevel programming
- On generalized semi-infinite optimization and bilevel optimization
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Solving bilevel programs with the KKT-approach
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- On calmness conditions in convex bilevel programming
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Optimality conditions for bilevel programming problems
- Bilevel Programming Problems
- New necessary optimality conditions in optimistic bilevel programming
