New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
From MaRDI portal
Publication:3058512
DOI10.1137/080725088zbMath1279.90187MaRDI QIDQ3058512
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
necessary optimality conditions; nonsmooth analysis; value function; bilevel programming problems; constraint qualifications; partial calmness
90C26: Nonconvex programming, global optimization
90C46: Optimality conditions and duality in mathematical programming
Related Items
Optimality Conditions for Bilevel Programming: An Approach Through Variational Analysis, Monotonicity of Optimal Contracts Without the First-Order Approach, 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, A multi-leader-follower game for energy demand-side management, Generic Property of the Partial Calmness Condition for Bilevel Programming Problems, Directional Necessary Optimality Conditions for Bilevel Programs, A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization, Necessary optimality conditions in pessimistic bilevel programming, Gradient-Based Solution Algorithms for a Class of Bilevel Optimization and Optimal Control Problems with a Nonsmooth Lower Level, Solution of bilevel optimization problems using the KKT approach, 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, Bilevel Polynomial Programs and Semidefinite Relaxation Methods, New Constraint Qualifications for S-Stationarity for MPEC with Nonsmooth Objective, 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, Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming, Unnamed Item, Unnamed Item, 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, On the solution of convex bilevel optimization problems, Solving ill-posed bilevel programs, Variational analysis of marginal functions with applications to bilevel programming, Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems, A smoothing augmented Lagrangian method for solving simple bilevel programs, Optimality conditions for pessimistic bilevel problems using convexificator, A modified homotopy method for solving the principal-agent bilevel programming problem, Bilevel programming and applications, A bridge between bilevel programs and Nash games, Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems, New necessary and sufficient optimality conditions for strong bilevel programming problems, Stackelberg-Nash equilibrium, social welfare and optimal structure in hierarchical continuous public goods game, A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs, Bilevel optimization: on the structure of the feasible set, The bilevel programming problem: reformulations, constraint qualifications and optimality conditions, An approach based on reliability-based possibility degree of interval for solving general interval bilevel linear programming problem, 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, Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming, Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method, R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization, Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs, Mixed-integer bilevel representability, Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints, Is pessimistic bilevel programming a special case of a mathematical program with complementarity constraints?, On solving simple bilevel programs with a nonconvex lower level program, A new method for strong-weak linear bilevel programming problem, A primal nonsmooth reformulation for bilevel optimization problems, Bilevel Optimal Control Problems with Pure State Constraints and Finite-dimensional Lower Level, Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems, A Cutting Plane Approach for Solving Linear Bilevel Programming Problems, On calmness conditions in convex bilevel programming
