On the Characterization of q-Superlinear Convergence of Quasi-Newton Methods for Constrained Optimization

DOI10.2307/2008330zbMath0632.90052OpenAlexW2072991112MaRDI QIDQ3770287

Josef Stoer, Richard A. Tapia

Publication date: 1987

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1911/101574

zbMATH Keywords

sequential quadratic programmingunconstrained minimizationquasi-Newton methodsDennis-Moré conditionq-superlinear convergenceequality constrained minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Newton-type methods (49M15)

Related Items

Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems, Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions, Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms, Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization