An SQP method for mathematical programs with vanishing constraints with strong convergence properties

DOI10.1007/s10589-017-9894-9zbMath1406.90094arXiv1611.08202OpenAlexW2558202019WikidataQ42291006 ScholiaQ42291006MaRDI QIDQ2013146

Matúš Benko, Helmut Gfrerer

Publication date: 3 August 2017

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.08202

zbMATH Keywords

SQP methodmathematical programs with vanishing constraints\({\mathcal {Q}}_M\)-stationarity\({\mathcal {Q}}\)-stationarity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)

Related Items

A study of one-parameter regularization methods for mathematical programs with vanishing constraints, A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control, Focus programming: a bi‐level programming approach to static stochastic optimization problems, New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints

Cites Work

• Unnamed Item
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
• A smoothing-regularization approach to mathematical programs with vanishing constraints
• Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
• An SQP method for mathematical programs with complementarity constraints with strong convergence properties
• On estimating the regular normal cone to constraint systems and stationarity conditions
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• On a relaxation method for mathematical programs with vanishing constraints