New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
From MaRDI portal
Publication:4639115
DOI10.1080/02331934.2017.1387547zbMath1398.90169arXiv1611.08206OpenAlexW2559516262WikidataQ47555811 ScholiaQ47555811MaRDI QIDQ4639115
Publication date: 3 May 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.08206
M-stationarityB-stationarity\(\mathcal Q_M\)-stationaritymathematical programs with disjunctive constraints
Related Items
An augmented Lagrangian method for optimization problems with structured geometric constraints, Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming, Relaxed constant positive linear dependence constraint qualification for disjunctive systems, Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications, Inexact penalty decomposition methods for optimization problems with geometric constraints, On the linear independence constraint qualification in disjunctive programming, A comparison of solution approaches for the numerical treatment of or-constrained optimization problems, Optimality conditions and exact penalty for mathematical programs with switching constraints, Linearized M-stationarity conditions for general optimization problems, Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs
Cites Work
- Unnamed Item
- Lipschitz and Hölder stability of optimization problems and generalized equations
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Representability in mixed integer programming. I: Characterization results
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- Convex programming for disjunctive convex optimization
- An SQP method for mathematical programs with vanishing constraints with strong convergence properties
- Calmness of constraint systems with applications
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- On Computation of Generalized Derivatives of the Normal-Cone Mapping and Their Applications
- On estimating the regular normal cone to constraint systems and stationarity conditions
- Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results
- First Order and Second Order Characterizations of Metric Subregularity and Calmness of Constraint Set Mappings
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Some continuity properties of polyhedral multifunctions
- Variational Analysis
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- A Generalized Mathematical Program with Equilibrium Constraints
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- A Fritz John Approach to First Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- Convex Analysis
- New Constraint Qualifications for Mathematical Programs with Equilibrium Constraints via Variational Analysis
