Optimality conditions and newton-type methods for mathematical programs with vanishing constraints
From MaRDI portal
Publication:2995702
DOI10.1134/S0965542509070069zbMath1224.90165OpenAlexW1977373127MaRDI QIDQ2995702
A. L. Pogosyan, Alexey F. Izmailov
Publication date: 4 May 2011
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542509070069
sequential quadratic programmingoptimality conditionsconstraint qualificationmathematical program with complementarity constraintsactive set methodmathematical program with vanishing constraints
Related Items
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 ⋮ Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties ⋮ On duality for mathematical programs with vanishing constraints ⋮ A smoothing-regularization approach to mathematical programs with vanishing constraints ⋮ New dualities for mathematical programs with vanishing constraints ⋮ Active-set Newton methods for mathematical programs with vanishing constraints ⋮ Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints ⋮ Mathematical programs with vanishing constraints: critical point theory ⋮ Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints ⋮ On a relaxation method for mathematical programs with vanishing constraints ⋮ On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints
