On the linear independence constraint qualification in disjunctive programming

DOI10.1080/02331934.2019.1679811MaRDI QIDQ5151501zbMATH OpenOpenAlexFDO

Authors P. Mehlitz

Publication date 19 February 2021

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1902.01614

zbMATH Keywords

constraint qualificationssecond-order optimality conditionsdisjunctive programmingstrong stationaritylinear independence constraint qualification

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

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

• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• 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.
• 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, sensitivity, and a relaxation method
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• 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 Structures in Nonlinear Programming
• Nonconvex penalization of switching control of partial differential equations
• 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

(25)

• 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
• Local properties and augmented Lagrangians in fully nonconvex composite optimization
• Inexact penalty decomposition methods for optimization problems with geometric constraints
• scientific article; zbMATH DE number 7733454 (Why is no real title available?)
• Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
• Sequential M-stationarity conditions for general optimization problems
• Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems
• Sparsity constrained optimization problems via disjunctive programming
• Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming
• Optimality conditions and constraint qualifications for cardinality constrained optimization problems
• Sufficient optimality conditions in bilevel programming
• An augmented Lagrangian method for optimization problems with structured geometric 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
• Relaxed constant positive linear dependence constraint qualification for disjunctive systems
• Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs
• Twice epi-differentiablity and parabolic regularity of a class of non-amenable functions
• Second-order optimality conditions for nonconvex set-constrained optimization problems
• Approximate stationarity in disjunctive optimization: concepts, qualification conditions, and application to MPCCs
• Strongly Stable Stationary Points for a Class of Generalized Equations
• Global convergence of augmented Lagrangian method applied to mathematical program with switching constraints
• Directionally variational analysis and second-order optimality conditions for mathematical programs with switching constraints
• scientific article; zbMATH DE number 7733432 (Why is no real title available?)
• Wolfe-type duality for mathematical programs with switching constraints

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)