The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
The authors introduce a bilevel programming problem in terms of an upper level problem \[ \min F(x, y) \quad\text{ s. t. } (x, y)\in X \times \mathbb R^m,\;y \in\Psi(x)\tag{ULP} \] where \(X\) is a closed subset of \(\mathbb R^n\) and \(\Psi(x)\) is the solution set of the lower level problem defined as: \[ \min f(x, y)\quad\text{ s. t. }y \in K(x). \] The functions \(F, f : \mathbb R^n \times \mathbb R^m \to\mathbb R\) are continuous, \(X = \{ x \mid G(x) \leq 0, H(x) = 0\}\), \(K(x) = \{ y\mid g(x, y) \leq 0, h(x, y) = 0\}\), where the functions \(G : \mathbb R^n \to \mathbb R^k\), \(H : \mathbb R^n \to \mathbb R^l\), \(g : \mathbb R^n\times \mathbb R^m \to \mathbb R^p\), \(h : \mathbb R^n \times \mathbb R^m \to \mathbb R^q\) are all continuous. Assuming feasibility of (ULP) the optimal value reformulation is \[ \min F(x, y)\quad \text{ s. t. } x \in X, \;y\in K(x),\;f(x, y) \leq \phi(x)\tag{OV} \] where \(\phi(x)\) is defined as: \(\phi(x) = \min \{ f(x, y) \mid y \in K(x)\}\). The authors contend that the problems (ULP) and (OV) are locally and globally equivalent. It is shown that the Mangasarian-Fromowitz constraint qualification in terms of basic generalized differentiation constructions of Mordukhovich fails and a weakened form of the same is used to derive Karush-Kuhn-Tucker optimality conditions for (ULP). They also suggest new sufficient conditions for the partial calmness based on a more general notion of the weak sharp minimum.
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Constraint qualifications and optimality conditions in bilevel optimization
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- scientific article; zbMATH DE number 1382559
- Optimality conditions for bilevel programming problems
- A note on optimality conditions for bilevel programming problems∗
- A subdifferential condition for calmness of multifunctions
- Bilevel programming with convex lower level problems
- Bilevel road pricing: theoretical analysis and optimality conditions
- Calmness for L-Subsmooth Multifunctions in Banach Spaces
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- Differential properties of the marginal function in mathematical programming
- Directional derivatives of the solution of a parametric nonlinear program
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Foundations of bilevel programming
- Generalized differential calculus for nonsmooth and set-valued mappings
- Lagrange Multipliers and Optimality
- Necessary optimality conditions for bilevel optimization problems using convexificators
- New necessary optimality conditions in optimistic bilevel programming
- New uniform parametric error bounds
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- On regularity for constrained extremum problems. I: Sufficient optimality conditions
- On regularity for constrained extremum problems. II: Necessary optimality conditions
- On the Calmness of a Class of Multifunctions
- On the co-derivative of normal cone mappings to inequality systems
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- On the regularity condition for vector programming problems
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- Optimality conditions for bilevel programming problems
- Optimality conditions for bilevel programming problems
- Optimality conditions for bilevel programming problems
- Optimization and nonsmooth analysis
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- The generalized jacobian of the optimal solution in parametric optimization
- Variational Stability and Marginal Functions via Generalized Differentiation
- On bilevel programs with a convex lower-level problem violating Slater's constraint qualification
- A bridge between bilevel programs and Nash games
- New necessary and sufficient optimality conditions for strong bilevel programming problems
- Bilevel road pricing: theoretical analysis and optimality conditions
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- New optimality conditions for the semivectorial bilevel optimization problem
- Optimality conditions for nonsmooth generalized semi-infinite programs
- Gauss-Newton-type methods for bilevel optimization
- 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
- Simple bilevel programming and extensions
- Necessary optimality conditions for nonsmooth multi-objective bilevel optimization problem under the optimistic perspective
- New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem
- Necessary optimality conditions for a semivectorial bilevel optimization problem using the kth-objective weighted-constraint approach
- Necessary optimality condition for trilevel optimization problem
- Optimality conditions for pessimistic semivectorial bilevel programming problems
- On multiobjective bilevel optimization using tangential subdifferentials
- A cutting plane approach for solving linear bilevel programming problems
- Weak and strong stationarity in generalized bilevel programming and bilevel optimal control
- Solving ill-posed bilevel programs
- Techniques for gradient-based bilevel optimization with non-smooth lower level problems
- scientific article; zbMATH DE number 1382559 (Why is no real title available?)
- Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs
- Optimality conditions for the simple convex bilevel programming problem in Banach spaces
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Monotonicity of optimal contracts without the first-order approach
- Optimality Conditions for a Nonsmooth Semivectorial Bilevel Optimization Problem
- Constraint qualifications and optimality conditions in bilevel optimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- scientific article; zbMATH DE number 7626760 (Why is no real title available?)
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Generic property of the partial calmness condition for bilevel programming problems
- Directional necessary optimality conditions for bilevel programs
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
- Necessary optimality conditions for a semivectorial bilevel problem under a partial calmness condition
- Necessary optimality conditions in pessimistic bilevel programming
- A simple approach to optimality conditions in minmax programming
- Optimality conditions for mixed discrete bilevel optimization problems
- An inertial extrapolation method for convex simple bilevel optimization
- Optimality conditions for bilevel programming problems
- Optimality conditions and duality results for a robust bi-level programming problem
- Extension of the value function reformulation to multiobjective bilevel optimization
- Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- Applying tangential subdifferentials in bilevel optimization
- On the partial calmness condition for an interval-valued bilevel optimization problem
- Notes on lower-level duality approach for bilevel programs
- Nonconvex quasi-variational inequalities: stability analysis and application to numerical optimization
- Approximate Karush-Kuhn-Tucker conditions for nonsmooth bilevel optimization problems
- Optimization problems with nonconvex multiobjective generalized Nash equilibrium problem constraints
- A fresh look at nonsmooth Levenberg–Marquardt methods with applications to bilevel optimization
- Special issue to celebrate the scientific career of Stephan Dempe
- Calmness of set-valued mappings between Asplund spaces and application to equilibrium problems
- Duality-based single-level reformulations of bilevel optimization problems
- Necessary optimality conditions for a semivectorial bilevel optimization problem via a revisited Charnes–Cooper scalarization
- Optimality conditions for nonsmooth vector interval-valued bilevel optimization problems in terms of tangential subdifferentials
- Charnes-Cooper scalarization to non-smooth semivectorial bilevel optimization problems
- A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
- Optimality conditions for pessimistic bilevel problems using convexificator
This page was built for publication: The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q630017)