Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications

DOI10.1016/j.jmaa.2007.03.087zbMath1141.90572OpenAlexW2046681554MaRDI QIDQ2382702

Christian Kanzow, Tim Hoheisel

Publication date: 2 October 2007

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2007.03.087

zbMATH Keywords

optimality conditionsconstraint qualificationsmathematical programs with equilibrium constraintslimiting normal coneMathematical programs with vanishing constraints

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46)

Related Items

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 ⋮ 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 ⋮ Lipschitz and Hölder stability of optimization problems and generalized equations ⋮ Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties ⋮ Exact penalty results for mathematical programs with vanishing constraints ⋮ 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 ⋮ On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems 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 ⋮ Necessary and sufficient conditions for M-stationarity of nonsmooth optimization problems with vanishing 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 ⋮ On Constraint Qualifications for Multiobjective Optimization Problems with Vanishing Constraints ⋮ On directionally differentiable multiobjective programming problems with vanishing constraints ⋮ Mathematical programs with vanishing constraints: critical point theory ⋮ Stationarity Condition for Nonsmooth MPVCs with Constraint Set ⋮ 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 ⋮ 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 ⋮ Mathematical programs with blocks of vanishing constraints arising in discretized mixed-integer optimal control problems ⋮ Unnamed Item ⋮ Optimality conditions and exact penalty for mathematical programs with switching constraints ⋮ On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints ⋮ Unnamed Item ⋮ Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints ⋮ 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 ⋮ Relaxation schemes for mathematical programmes with switching constraints

Uses Software

• MacMPEC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• Foundations of optimization
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
• A smoothing method for mathematical programs with equilibrium constraints
• A smoothing-regularization approach to mathematical programs with vanishing constraints
• Abadie-type constraint qualification for mathematical programs with equilibrium constraints
• Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
• Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• A direct proof for M-stationarity under MPEC-GCQ for mathematical programs with equilibrium constraints
• On the Guignard constraint qualification for mathematical programs with equilibrium constraints
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• Some continuity properties of polyhedral multifunctions
• Numerical Optimization
• Variational Analysis
• A Generalized Mathematical Program with Equilibrium Constraints
• Some properties of regularization and penalization schemes for MPECs
• Solving mathematical programs with complementarity constraints as nonlinear programs
• Optimality Conditions for Optimization Problems with Complementarity Constraints
• On the Calmness of a Class of Multifunctions
• Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
• Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
• Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
• A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
• Interior Methods for Mathematical Programs with Complementarity Constraints
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• A Necessary and Sufficient Qualification for Constrained Optimization

This page was built for publication: Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications