On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming

DOI10.1093/imamat/21.1.67zbMath0373.90056OpenAlexW2013434059MaRDI QIDQ4152346

Michael Bartholomew-Biggs

Publication date: 1978

Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imamat/21.1.67

Mathematics Subject Classification ID

Quadratic programming (90C20) Search theory (90B40)

Related Items

Geometric approach to Fletcher's ideal penalty function, Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems, Numerical methods for singular optimal control, A recursive quadratic programming algorithm that uses differentiable exact penalty functions, Two-level decomposition in sequential quadratic programming with penalty functions, A two-stage feasible directions algorithm for nonlinear constrained optimization, Computer experiments on quadratic programming algorithms, Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function, A New Algorithm To Solve Calculus Of Variations Problems Using Wolef's Convergence Theory,Part 1:Theory And Algorithm, A trust region algorithm for equality constrained optimization, An exact penalty-Lagrangian approach for large-scale nonlinear programming, An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems, Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization, The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis, Local convergence analysis for the REQP algorithm using conjugate basis matrices, Equality and inequality constrained optimization algorithms with convergent stepsizes