On the linear independence constraint qualification in disjunctive programming
From MaRDI portal
Recommendations
- Optimality conditions and exact penalty for mathematical programs with switching constraints
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints
- Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
Cites work
- Calmness of constraint systems with applications
- Complete characterizations of tilt stability in nonlinear programming under weakest qualification conditions
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- Mathematical programs with blocks of vanishing constraints arising in discretized mixed-integer optimal control problems
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
- No-gap second-order conditions via a directional curvature functional
- Nonconvex penalization of switching control of partial differential equations
- Nonconvex Structures in Nonlinear Programming
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On a relaxation method for mathematical programs with vanishing constraints
- On computation of generalized derivatives of the normal-cone mapping and their applications
- On directional metric subregularity and second-order optimality conditions for a class of nonsmooth mathematical programs
- On estimating the regular normal cone to constraint systems and stationarity conditions
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- 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
- Optimality conditions for sparse nonlinear programming
- Relaxation schemes for mathematical programmes with switching constraints
- Second-Order Conditions for Optimization Problems with Constraints
- Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems
- Second-order optimality conditions for mathematical programs with equilibrium constraints
- Set-valued analysis
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Variational Analysis
Cited in
(27)- 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
- Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs
- Global convergence of augmented Lagrangian method applied to mathematical program with switching constraints
- Reformulation of the M-stationarity conditions as a system of discontinuous equations and its solution by a semismooth Newton method
- Sufficient optimality conditions in bilevel programming
- Sparsity constrained optimization problems via disjunctive programming
- Second-order optimality conditions for nonconvex set-constrained optimization problems
- Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel 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
- scientific article; zbMATH DE number 7733432 (Why is no real title available?)
- Strongly Stable Stationary Points for a Class of Generalized Equations
- scientific article; zbMATH DE number 7733454 (Why is no real title available?)
- Wolfe-type duality for mathematical programs with switching constraints
- Local properties and augmented Lagrangians in fully nonconvex composite optimization
- Sequential M-stationarity conditions for general optimization problems
- Optimality conditions and constraint qualifications for cardinality constrained optimization problems
- Twice epi-differentiablity and parabolic regularity of a class of non-amenable functions
- Approximate stationarity in disjunctive optimization: concepts, qualification conditions, and application to MPCCs
- Directionally variational analysis and second-order optimality conditions for mathematical programs with switching constraints
- Revisiting implicit variables in mathematical optimization: simplified modeling and a numerical evidence
- Second-order optimality conditions for nonsmooth constrained optimization with applications to bilevel programming
This page was built for publication: On the linear independence constraint qualification in disjunctive programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151501)
