Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
From MaRDI portal
Publication:4340798
DOI10.1137/S1052623493257344zbMath0873.49018MaRDI QIDQ4340798
Jane J. Ye, Qiji J. Zhu, Dao-Li Zhu
Publication date: 12 June 1997
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
necessary optimality conditions; nonsmooth analysis; variational inequalities; uniform parametric error bounds; exact penalty formulations; GBLP; generalized bilevel programming problems
90C29: Multi-objective and goal programming
91A65: Hierarchical games (including Stackelberg games)
49M29: Numerical methods involving duality
49J40: Variational inequalities
49K99: Optimality conditions
Related Items
Some properties of regularization and penalization schemes for MPECs, Multipliers and general Lagrangians, Exact penalty functions for convex bilevel programming problems., Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints, Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints, The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs, Optimization problems with equilibrium constraints and their numerical solution., On the existence of solutions to stochastic mathematical programs with equilibrium constraints, A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints, A penalty function method based on bilevel programming for solving inverse optimal value problems, A class of quadratic programs with linear complementarity constraints, A \(\mathcal{UV}\)-decomposed method for solving an MPEC problem, Partial exact penalty for mathematical programs with equilibrium constraints, Optimality conditions for vector optimization problems, New uniform parametric error bounds, Model and extended Kuhn-Tucker approach for bilevel multi-follower decision making in a referential-uncooperative situation, Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints, On calmness conditions in convex bilevel programming, Quasiconvex programming with locally starshaped constraint region and applications to quasiconvex MPEC, Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
