Cargando…
An SQP method for mathematical programs with vanishing constraints with strong convergence properties
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 [Formula: see text] -stationarity (Benko and Gfrerer in Optimization 66(1):6...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2017
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5397537/ https://www.ncbi.nlm.nih.gov/pubmed/28479672 http://dx.doi.org/10.1007/s10589-017-9894-9 |