Relaxed constant positive linear dependence constraint qualification for disjunctive systems
From MaRDI portal
Publication:6076766
DOI10.1007/s11228-023-00683-2zbMath1523.90311arXiv2204.09869MaRDI QIDQ6076766
Publication date: 22 September 2023
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.09869
error boundsconstraint qualificationsswitching systemRCPLDdisjunctive programcomplementarity systemortho-disjunctive programpiecewise RCPLDvanishing system
Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Unnamed Item
- Normally admissible stratifications and calculation of normal cones to a finite union of polyhedral sets
- Second-order optimality conditions for mathematical programs with equilibrium constraints
- A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints
- New results on constraint qualifications for nonlinear extremum problems and extensions
- Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property
- Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- A relaxed constant positive linear dependence constraint qualification and applications
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Critical multipliers in variational systems via second-order generalized differentiation
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- 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
- Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs
- 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 and its application to bilevel programs
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
- Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- Optimality Conditions for Disjunctive Programs Based on Generalized Differentiation with Application to Mathematical Programs with Equilibrium Constraints
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Optimization and nonsmooth analysis
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Variational Analysis
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
- Directional Necessary Optimality Conditions for Bilevel Programs
- On the linear independence constraint qualification in disjunctive programming
- Directional Quasi-/Pseudo-Normality as Sufficient Conditions for Metric Subregularity
- On Directional Metric Subregularity and Second-Order Optimality Conditions for a Class of Nonsmooth Mathematical Programs
- Mathematical Programs with Geometric Constraints in Banach Spaces: Enhanced Optimality, Exact Penalty, and Sensitivity
- Convex Analysis
- Relaxation schemes for mathematical programmes with switching constraints
- Mathematical Programs with Equilibrium Constraints
