Bilevel Optimization: Reformulation and First Optimality Conditions
From MaRDI portal
Publication:4557871
DOI10.1007/978-981-10-4774-9_1zbMath1487.90532OpenAlexW2795565301MaRDI QIDQ4557871
Publication date: 27 November 2018
Published in: Forum for Interdisciplinary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-10-4774-9_1
Karush-Kuhn-Tucker conditionsnonconvex optimization problemsbilevel optimization problemslower level problemone-level optimization problem
Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)
Related Items
Recent advances in nonconvex semi-infinite programming: applications and algorithms, On computation of optimal strategies in oligopolistic markets respecting the cost of change, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the solution of convex bilevel optimization problems
- Solution algorithm for an optimistic linear Stackelberg problem
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Towards global bilevel dynamic optimization
- Subgradients of marginal functions in parametric mathematical programming
- Nonlinear optimization: Characterization of structural stability
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Practical bilevel optimization. Algorithms and applications
- A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
- Foundations of bilevel programming
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- Weak via strong Stackelberg problem: New results
- Directional derivatives of the solution of a parametric nonlinear program
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- Introduction to Piecewise Differentiable Equations
- Feasible direction method for bilevel programming problem
- Parametric Nonlinear Programming Problems under the Relaxed Constant Rank Condition
- Optimization and nonsmooth analysis
- Differential properties of the marginal function in mathematical programming
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- A necessary and a sufficient optimality condition for bilevel programming problems
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Optimality conditions for bilevel programming problems
- Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming
- Necessary optimality conditions in pessimistic bilevel programming
- Bilevel Programming Problems
- New necessary optimality conditions in optimistic bilevel programming
- Nonlinear Programming
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- Mathematical Programs with Optimization Problems in the Constraints
