Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints
From MaRDI portal
Publication:3192108
DOI10.1137/130914449zbMATH Open1298.49021arXiv1611.08257OpenAlexW3100765371MaRDI QIDQ3192108FDOQ3192108
Authors: Helmut Gfrerer 
Publication date: 26 September 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Abstract: We consider optimization problems with a disjunctive structure of the constraints. Prominent examples of such problems are mathematical programs with equilibrium constraints or vanishing constraints. Based on the concepts of directional subregularity and their characterization by means of objects from generalized differentiation, we obtain the new stationarity concept of extended M-stationarity, which turns out to be an equivalent dual characterization of B-stationarity. These results are valid under a very weak constraint qualification of Guignard type which is usually very difficult to verify. We also state a new constraint qualification which is a little bit stronger but verifiable. Further we present second-order optimality conditions, both necessary and sufficient. Finally we apply these results to the special case of mathematical programs with equilibrium constraints and compute explicitly all the objects from generalized differentiation. For this type of problems we also introduce the concept of strong M-stationarity which builds a bridge between S-stationarity and M-stationarity.
Full work available at URL: https://arxiv.org/abs/1611.08257
Recommendations
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Constraint qualifications for nonsmooth mathematical programs with equilibrium constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- A direct proof for M-stationarity under MPEC-GCQ for mathematical programs with equilibrium constraints
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
equilibrium constraintsoptimality conditionsgeneralized differentiationmultifunctionsmetric subregularityM-stationarity
Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Set-valued and variational analysis (49J53) Optimality conditions for problems involving relations other than differential equations (49K21) Derivative-free methods and methods using generalized derivatives (90C56)
Cited In (49)
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
- Reformulation of the M-stationarity conditions as a system of discontinuous equations and its solution by a semismooth Newton method
- Calculus for directional limiting normal cones and subdifferentials
- Local properties and augmented Lagrangians in fully nonconvex composite optimization
- New constraint qualifications for mathematical programs with equilibrium constraints via variational analysis
- Optimality conditions for circular cone complementarity programs
- Calmness and calculus: two basic patterns
- Lipschitz-like property relative to a set and the generalized Mordukhovich criterion
- Robinson Stability of Parametric Constraint Systems via Variational Analysis
- Scaled constraint qualifications for generalized equation constrained problems and application to nonsmooth mathematical programs with equilibrium constraints
- Linearized M-stationarity conditions for general optimization problems
- Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
- On Lipschitzian properties of implicit multifunctions
- Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems
- Sparsity constrained optimization problems via disjunctive programming
- Optimality conditions and constraint qualifications for cardinality constrained optimization problems
- On a Semismooth* Newton Method for Solving Generalized Equations
- Disjunctive programming and the generalized Leontief input-output model
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- New sharp necessary optimality conditions for mathematical programs with equilibrium constraints
- Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems
- Partially B-Regular Optimization and Equilibrium Problems
- Directional quasi-/pseudo-normality as sufficient conditions for metric subregularity
- Relaxed constant positive linear dependence constraint qualification for disjunctive systems
- Optimality conditions and exact penalty for mathematical programs with switching constraints
- Second order variational analysis of disjunctive constraint sets and its applications to optimization problems
- Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis
- Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Lipschitz and Hölder stability of optimization problems and generalized equations
- On the linear independence constraint qualification in disjunctive programming
- Second-order optimality conditions for nonconvex set-constrained optimization problems
- Directional necessary optimality conditions for bilevel programs
- Directional derivative of the value function for parametric set-constrained optimization problems
- Calculus of directional coderivatives and normal cones in Asplund spaces
- Some results on mathematical programs with equilibrium constraints
- On computation of limiting coderivatives of the normal-cone mapping to inequality systems and their applications
- MPEC methods for bilevel optimization problems
- Variational analysis of composite models with applications to continuous optimization
- On the directional asymptotic approach in optimization theory
- Calculus of directional subdifferentials and coderivatives in Banach spaces
- Pathfollowing for parametric mathematical programs with complementarity constraints
- Title not available (Why is that?)
- New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
- Complete characterizations of tilt stability in nonlinear programming under weakest qualification conditions
- Calmness of partial perturbation to composite rank constraint systems and its applications
- Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints
- Second-order optimality conditions for mathematical program with semidefinite cone complementarity constraints and applications
- On estimating the regular normal cone to constraint systems and stationarity conditions
This page was built for publication: Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192108)
