New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches

DOI10.1137/080725088zbMath1279.90187OpenAlexW2044241503MaRDI QIDQ3058512

Jane J. Ye, Dao-Li Zhu

Publication date: 3 December 2010

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2e7bc1c856cf9bb80870b9b945c5ee8b5ab61e68

zbMATH Keywords

necessary optimality conditionsnonsmooth analysisvalue functionbilevel programming problemsconstraint qualificationspartial calmness

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items (60)

Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming ⋮ Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints ⋮ Optimality conditions for pessimistic bilevel problems using convexificator ⋮ A multi-leader-follower game for energy demand-side management ⋮ Solving ill-posed bilevel programs ⋮ Optimality Conditions for Bilevel Programming: An Approach Through Variational Analysis ⋮ A modified homotopy method for solving the principal-agent bilevel programming problem ⋮ Generic Property of the Partial Calmness Condition for Bilevel Programming Problems ⋮ Bilevel programming and applications ⋮ Directional Necessary Optimality Conditions for Bilevel Programs ⋮ A bridge between bilevel programs and Nash games ⋮ Bilevel optimization: on the structure of the feasible set ⋮ Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems ⋮ Bilevel Polynomial Programs and Semidefinite Relaxation Methods ⋮ Is pessimistic bilevel programming a special case of a mathematical program with complementarity constraints? ⋮ Variational analysis of marginal functions with applications to bilevel programming ⋮ Nash and Stackelberg equilibria in games with pay-off functions constructed by minimum convolutions of antagonistic and private criteria ⋮ Estimates for coderivative of solution map in bilevel program ⋮ Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs ⋮ New necessary and sufficient optimality conditions for strong bilevel programming problems ⋮ A primal nonsmooth reformulation for bilevel optimization problems ⋮ The bilevel programming problem: reformulations, constraint qualifications and optimality conditions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Mixed-integer bilevel representability ⋮ New Constraint Qualifications for S-Stationarity for MPEC with Nonsmooth Objective ⋮ On solving simple bilevel programs with a nonconvex lower level program ⋮ Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems ⋮ On calmness conditions in convex bilevel programming ⋮ A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization ⋮ Stackelberg-Nash equilibrium, social welfare and optimal structure in hierarchical continuous public goods game ⋮ An approach based on reliability-based possibility degree of interval for solving general interval bilevel linear programming problem ⋮ Necessary optimality conditions in pessimistic bilevel programming ⋮ Bilevel Optimal Control Problems with Pure State Constraints and Finite-dimensional Lower Level ⋮ A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs ⋮ Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization ⋮ Convexification method for bilevel programs with a nonconvex Follower's problem ⋮ Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems ⋮ A new method for strong-weak linear bilevel programming problem ⋮ A Cutting Plane Approach for Solving Linear Bilevel Programming Problems ⋮ Gradient-Based Solution Algorithms for a Class of Bilevel Optimization and Optimal Control Problems with a Nonsmooth Lower Level ⋮ A smoothing augmented Lagrangian method for solving simple bilevel programs ⋮ Monotonicity of Optimal Contracts Without the First-Order Approach ⋮ Solution of bilevel optimization problems using the KKT approach ⋮ Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming ⋮ Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs ⋮ A multi-leader-follower game for energy demand-side management ⋮ Genericity Analysis of Multi-Leader-Disjoint-Followers Game ⋮ Interactions Between Bilevel Optimization and Nash Games ⋮ Bilevel Optimization and Variational Analysis ⋮ Constraint Qualifications and Optimality Conditions in Bilevel Optimization ⋮ MPEC Methods for Bilevel Optimization Problems ⋮ Approximate Bilevel Optimization with Population-Based Evolutionary Algorithms ⋮ BOLIB: Bilevel Optimization LIBrary of Test Problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method ⋮ Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints ⋮ Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming ⋮ R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization ⋮ On the solution of convex bilevel optimization problems

This page was built for publication: New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches