Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
From MaRDI portal
Publication:2028500
DOI10.1007/s10589-020-00250-7zbMath1469.90146arXiv2004.10830OpenAlexW3118521211MaRDI QIDQ2028500
Alain B. Zemkoho, Sheng-Long Zhou
Publication date: 1 June 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.10830
Related Items
Extension of the value function reformulation to multiobjective bilevel optimization, Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization, A primal nonsmooth reformulation for bilevel optimization problems, Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the solution of convex bilevel optimization problems
- Solution algorithm for an optimistic linear Stackelberg problem
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- Introduction to sensitivity and stability analysis in nonlinear programming
- Some properties of the bilevel programming problem
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Practical bilevel optimization. Algorithms and applications
- A semismooth equation approach to the solution of nonlinear complementarity problems
- Foundations of bilevel programming
- A bridge between bilevel programs and Nash games
- Numerically tractable optimistic bilevel problems
- A nonsmooth version of Newton's method
- On solving simple bilevel programs with a nonconvex lower level program
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Weak and strong stationarity in generalized bilevel programming and bilevel optimal control
- Feasible direction method for bilevel programming problem
- On calmness conditions in convex bilevel programming
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- Optimization and nonsmooth analysis
- Differential properties of the marginal function in mathematical programming
- Semismooth and Semiconvex Functions in Constrained Optimization
- A special newton-type optimization method
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
- Variational Analysis
- Variational Analysis and Applications
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Optimality conditions for bilevel programming problems
- BOLIB: Bilevel Optimization LIBrary of Test Problems
- Solution of bilevel optimization problems using the KKT approach
- New necessary optimality conditions in optimistic bilevel programming
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
