On the linear independence constraint qualification in disjunctive programming
From MaRDI portal
Publication:5151501
DOI10.1080/02331934.2019.1679811OpenAlexW2981523039MaRDI QIDQ5151501
Publication date: 19 February 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.01614
disjunctive programmingsecond-order optimality conditionsconstraint qualificationsstrong stationaritylinear independence constraint qualification
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming, Sparsity constrained optimization problems via disjunctive programming, An augmented Lagrangian method for optimization problems with structured geometric constraints, Relaxed constant positive linear dependence constraint qualification for disjunctive systems, Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems, Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications, Inexact penalty decomposition methods for optimization problems with geometric constraints, Strongly Stable Stationary Points for a Class of Generalized Equations, Global convergence of augmented Lagrangian method applied to mathematical program with switching constraints, Unnamed Item, Unnamed Item, 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, Second order variational analysis of disjunctive constraint sets and its applications to optimization problems, Reformulation of the M-Stationarity Conditions as a System of Discontinuous Equations and Its Solution by a Semismooth Newton Method, Second-Order Optimality Conditions for Nonconvex Set-Constrained Optimization Problems, Sufficient Optimality Conditions in Bilevel Programming, Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs
Cites Work
- Unnamed Item
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- Second-order optimality conditions for mathematical programs with equilibrium constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems
- Nonconvex penalization of switching control of partial differential equations
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Mathematical programs with blocks of vanishing constraints arising in discretized mixed-integer optimal control problems
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- Optimality conditions for sparse nonlinear programming
- 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
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- On estimating the regular normal cone to constraint systems and stationarity conditions
- Optimality Conditions for Disjunctive Programs Based on Generalized Differentiation with Application to Mathematical Programs with Equilibrium Constraints
- Complete Characterizations of Tilt Stability in Nonlinear Programming under Weakest Qualification Conditions
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Nonconvex Structures in Nonlinear Programming
- Second-Order Conditions for Optimization Problems with Constraints
- Variational Analysis
- No-Gap Second-Order Conditions via a Directional Curvature Functional
- New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
- On a relaxation method for mathematical programs with vanishing constraints
- Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control
- On Directional Metric Subregularity and Second-Order Optimality Conditions for a Class of Nonsmooth Mathematical Programs
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- Relaxation schemes for mathematical programmes with switching constraints
- Set-valued analysis
