Directional necessary optimality conditions for bilevel programs
From MaRDI portal
Publication:5085136
Abstract: The bilevel program is an optimization problem where the constraint involves solutions to a parametric optimization problem. It is well-known that the value function reformulation provides an equivalent single-level optimization problem but it results in a nonsmooth optimization problem which never satisfies the usual constraint qualification such as the Mangasarian-Fromovitz constraint qualification (MFCQ). In this paper we show that even the first order sufficient condition for metric subregularity (which is in general weaker than MFCQ) fails at each feasible point of the bilevel program. We introduce the concept of directional calmness condition and show that under {the} directional calmness condition, the directional necessary optimality condition holds. {While the directional optimality condition is in general sharper than the non-directional one,} the directional calmness condition is in general weaker than the classical calmness condition and hence is more likely to hold. {We perform the directional sensitivity analysis of the value function and} propose the directional quasi-normality as a sufficient condition for the directional calmness. An example is given to show that the directional quasi-normality condition may hold for the bilevel program.
Recommendations
- Optimality conditions for bilevel programming problems
- Optimality conditions for bilevel programming problems
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- New necessary optimality conditions in optimistic bilevel programming
Cites work
- scientific article; zbMATH DE number 1943822 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- A note on optimality conditions for bilevel programming problems∗
- Bilevel optimization. Advances and next challenges
- Bilevel programming and applications
- Calculus for directional limiting normal cones and subdifferentials
- Calculus of directional subdifferentials and coderivatives in Banach spaces
- Calmness of constraint systems with applications
- Classification model selection via bilevel programming
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Differential properties of the marginal function in mathematical programming
- Directional derivative of the marginal function in nonlinear programming
- Directional quasi-/pseudo-normality as sufficient conditions for metric subregularity
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Implicit Functions and Solution Mappings
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Lipschitz and Hölder stability of optimization problems and generalized equations
- Mathematical Programs with Equilibrium Constraints
- Mathematical programs with geometric constraints in Banach spaces: enhanced optimality, exact penalty, and sensitivity
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Necessary optimality conditions for multiobjective bilevel programs
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- New sharp necessary optimality conditions for mathematical programs with equilibrium constraints
- On Lipschitz-like continuity of a class of set-valued mappings
- On calmness conditions in convex bilevel programming
- On directional metric regularity, subregularity and optimality conditions for nonsmooth mathematical programs
- On directionally dependent subdifferentials
- On metric pseudo-(sub)regularity of multifunctions and optimality conditions for degenerated mathematical programs
- On the numerical solution of a class of Stackelberg problems
- Optimality conditions for bilevel programming problems
- Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints
- Optimization and nonsmooth analysis
- Parametric Nonlinear Programming Problems under the Relaxed Constant Rank Condition
- Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs
- Robinson Stability of Parametric Constraint Systems via Variational Analysis
- Sensitivity analysis of the value function for parametric mathematical programs with equilibrium constraints
- Variational Analysis
- Variational Analysis and Generalized Differentiation I
Cited in
(9)- A Lagrange multiplier expression method for bilevel polynomial optimization
- Directional derivative of the value function for parametric set-constrained optimization problems
- scientific article; zbMATH DE number 7733432 (Why is no real title available?)
- scientific article; zbMATH DE number 7733454 (Why is no real title available?)
- Relaxed constant positive linear dependence constraint qualification for disjunctive systems
- Linearly convergent bilevel optimization with single-step inner methods
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- On the directional asymptotic approach in optimization theory
This page was built for publication: Directional necessary optimality conditions for bilevel programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085136)
