An SQP method for mathematical programs with vanishing constraints with strong convergence properties
Sign Up to like & getrecommendations! Published in 2017 at "Computational Optimization and Applications"
DOI: 10.1007/s10589-017-9894-9
Abstract: We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of $${\mathcal {Q}}$$Q-stationarity… read more here.
Keywords: mathematical programs; method mathematical; constraints strong; sqp method ... See more keywords