Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
From MaRDI portal
Publication:2903144
DOI10.1080/02331934.2011.608164zbMath1251.65089OpenAlexW1989282113MaRDI QIDQ2903144
Alexandra Schwartz, Christian Kanzow, Tim Hoheisel
Publication date: 23 August 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.608164
global convergenceregularization methodconstraint qualificationcomplementarity constraintsequilibrium constraintsvanishing constraintsmathematical programs
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
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 ⋮ On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints ⋮ On directionally differentiable multiobjective programming problems with vanishing constraints ⋮ Unnamed Item ⋮ Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method ⋮ Relaxation schemes for mathematical programmes with switching constraints
Cites Work
- Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints.
- 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
- A modified relaxation scheme for mathematical programs with complementarity constraints
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
- Optimality conditions and newton-type methods for mathematical programs with vanishing constraints
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- A New Regularization Scheme for Mathematical Programs with Complementarity Constraints
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
