On the Performance of SQP Methods for Nonlinear Optimization

DOI10.1007/978-3-319-23699-5_5zbMath1372.65170OpenAlexW2336762304MaRDI QIDQ5351615

Philip E. Gill, Elizabeth Wong, Michael A. Saunders

Publication date: 29 August 2017

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23699-5_5

zbMATH Keywords

quadratic programmingsequential quadratic programmingnonlinear programmingconvexificationnumerical resultactive-set methodsinterior methodsquasi-Newton approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Quadratic programming (90C20) Methods of quasi-Newton type (90C53) Methods of successive quadratic programming type (90C55)

Related Items (1)

Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints

Uses Software

• CUTEst

This page was built for publication: On the Performance of SQP Methods for Nonlinear Optimization