New sharp necessary optimality conditions for mathematical programs with equilibrium constraints
From MaRDI portal
Publication:2190754
Abstract: In this paper, we study the mathematical program with equilibrium constraints (MPEC) formulated as a mathematical program with a parametric generalized equation involving the regular normal cone. We derive a new necessary optimality condition which is sharper than the usual M-stationary condition and is applicable even when no constraint qualifications hold for the corresponding mathematical program with complementarity constraints (MPCC) reformulation.
Recommendations
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
- Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints
- New constraint qualifications for mathematical programs with equilibrium constraints via variational analysis
Cites work
- Calmness of constraint systems with applications
- Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
- Complete characterizations of tilt stability in nonlinear programming under weakest qualification conditions
- Convex Analysis
- Extremum conditions for smooth problems with equality-type constraints
- First order and second order characterizations of metric subregularity and calmness of constraint set mappings
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Linearized M-stationarity conditions for general optimization problems
- Lipschitz and Hölder stability of optimization problems and generalized equations
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Necessary and sufficient conditions for optimality of p-th order
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- New constraint qualifications for mathematical programs with equilibrium constraints via variational analysis
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On computation of generalized derivatives of the normal-cone mapping and their applications
- On computation of limiting coderivatives of the normal-cone mapping to inequality systems and their applications
- On directional metric regularity, subregularity and optimality conditions for nonsmooth mathematical programs
- On directional metric subregularity and second-order optimality conditions for a class of nonsmooth mathematical programs
- On M-stationarity conditions in MPECs and the associated qualification conditions
- Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Optimization and nonsmooth analysis
- Regularity and conditioning of solution mappings in variational analysis
- Variational Analysis
Cited in
(21)- Calmness and calculus: two basic patterns
- Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints
- On estimating the regular normal cone to constraint systems and stationarity conditions
- A Generalized Mathematical Program with Equilibrium Constraints
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
- Constraint qualifications and optimality conditions in bilevel optimization
- A note on the paper “Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints”
- Generic property of the partial calmness condition for bilevel programming problems
- Directional necessary optimality conditions for bilevel programs
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- New constraint qualifications for mathematical programs with equilibrium constraints via variational analysis
- Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences
- Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems
- On some optimality conditions for a class of problems in mathematical programming with equilibrium constraints
- scientific article; zbMATH DE number 7733454 (Why is no real title available?)
- Nonconvex quasi-variational inequalities: stability analysis and application to numerical optimization
- Optimality conditions for bilevel programmes via Moreau envelope reformulation*
- On second-order weak sharp minima of general nonconvex set-constrained optimization problems
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
This page was built for publication: New sharp necessary optimality conditions for mathematical programs with equilibrium constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190754)
