Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method

DOI10.1080/02331934.2018.1542531zbMath1421.90137OpenAlexW2804465715MaRDI QIDQ4634163

Tangi Migot, Jean-Pierre Dussault, Mounir Haddou

Publication date: 7 May 2019

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

nonlinear programmingMPECrelaxation methodsMPCCMPVC

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (7)

A study of one-parameter regularization methods for mathematical programs with vanishing constraints ⋮ Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints ⋮ Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints ⋮ On directionally differentiable multiobjective programming problems with vanishing constraints ⋮ Unnamed Item ⋮ A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function ⋮ Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method

Cites Work

• Mathematical programs with vanishing constraints: critical point theory
• On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints
• On error bounds for quasinormal programs
• Exact penalty results for mathematical programs with vanishing 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
• Active-set Newton methods for mathematical programs with vanishing constraints
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
• A smoothing-regularization approach to mathematical programs with vanishing constraints
• Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
• Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
• A Cone-Continuity Constraint Qualification and Algorithmic Consequences
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
• Two New Weak Constraint Qualifications and Applications
• On a relaxation method for mathematical programs with vanishing constraints
• A Necessary and Sufficient Qualification for Constrained Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method