On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints

DOI10.1080/02331930701763405zbMath1162.90560OpenAlexW2005456264MaRDI QIDQ3632706

Christian Kanzow, Tim Hoheisel

Publication date: 12 June 2009

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930701763405

zbMATH Keywords

Abadie constraint qualificationmathematical programmes with equilibrium constraintsmathematical programmes with vanishing constraintsGuignard constraint qualification

Mathematics Subject Classification ID

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

Related Items

A pivoting algorithm for linear programming with linear complementarity constraints ⋮ Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints ⋮ On stationarity for nonsmooth multiobjective problems with vanishing constraints ⋮ A study of one-parameter regularization methods for mathematical programs with vanishing constraints ⋮ Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems ⋮ Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints ⋮ On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints ⋮ Decomposition and Approximation for PDE-Constrained Mixed-Integer Optimal Control ⋮ Computational approaches for mixed integer optimal control problems with indicator constraints ⋮ Two optimal value functions in parametric conic linear programming ⋮ Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties ⋮ Exact penalty results for mathematical programs with vanishing constraints ⋮ Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications ⋮ The characterization of efficiency and saddle point criteria for multiobjective optimization problem with vanishing constraints ⋮ Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints ⋮ On duality for mathematical programs with vanishing constraints ⋮ A smoothing-regularization approach to mathematical programs with vanishing constraints ⋮ Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints ⋮ New dualities for mathematical programs with vanishing constraints ⋮ Active-set Newton methods for mathematical programs with vanishing constraints ⋮ Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints ⋮ Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming ⋮ Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints ⋮ Relaxed constant positive linear dependence constraint qualification for disjunctive systems ⋮ On Constraint Qualifications for Multiobjective Optimization Problems with Vanishing Constraints ⋮ Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints ⋮ Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications ⋮ Approximation Properties and Tight Bounds for Constrained Mixed-Integer Optimal Control ⋮ On directionally differentiable multiobjective programming problems with vanishing constraints ⋮ Mathematical programs with vanishing constraints: critical point theory ⋮ Unnamed Item ⋮ On estimating the regular normal cone to constraint systems and stationarity conditions ⋮ Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints ⋮ Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method ⋮ On a relaxation method for mathematical programs with vanishing constraints ⋮ On the linear independence constraint qualification in disjunctive programming ⋮ Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints ⋮ First- and second-order optimality conditions for mathematical programs with vanishing constraints. ⋮ On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints ⋮ An SQP method for mathematical programs with vanishing constraints with strong convergence properties ⋮ Mathematical programs with blocks of vanishing constraints arising in discretized mixed-integer optimal control problems ⋮ Unnamed Item ⋮ Lagrange multiplier characterizations of constrained best approximation with infinite constraints ⋮ Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization ⋮ On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints ⋮ Unnamed Item ⋮ Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method ⋮ Some non-smooth optimality results for optimization problems with vanishing constraints via Dini-Hadamard derivative ⋮ Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs

Cites Work

• Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
• Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
• Abadie-type constraint qualification for mathematical programs with equilibrium constraints
• Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
• On the Guignard constraint qualification for mathematical programs with equilibrium constraints
• Numerical Optimization
• Optimality Conditions for Optimization Problems with Complementarity Constraints
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• A Necessary and Sufficient Qualification for Constrained Optimization