Optimality conditions and newton-type methods for mathematical programs with vanishing constraints

DOI10.1134/S0965542509070069zbMATH Open1224.90165OpenAlexW1977373127MaRDI QIDQ2995702FDOQ2995702

A. F. Izmailov, A. L. Pogosyan

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

zbMATH Keywords

sequential quadratic programmingoptimality conditionsconstraint qualificationmathematical program with complementarity constraintsactive set methodmathematical program with vanishing constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited In (16)

• Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints
• Nonsmooth Mathematical Programs with Vanishing Constraints in Banach Spaces
• Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
• A smoothing-regularization approach to mathematical programs with vanishing constraints
• On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints
• Mathematical programs with vanishing constraints: critical point theory
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• Active-set Newton methods for mathematical programs with vanishing constraints
• On duality for mathematical programs with vanishing constraints
• Optimality analysis and duality conditions for a class of conic semi-infinite program having vanishing constraints
• On a relaxation method for mathematical programs with vanishing constraints
• New dualities for mathematical programs with vanishing constraints
• On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints
• Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints
• Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
• A study of one-parameter regularization methods for mathematical programs with vanishing constraints

This page was built for publication: Optimality conditions and newton-type methods for mathematical programs with vanishing constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995702)