The local convergence of the Byrd-Schnabel algorithm for constrained optimization

DOI10.1016/0893-9659(93)90030-QzbMath0773.90066OpenAlexW1995469571MaRDI QIDQ2367977

Aiping Liao, Thomas F. Coleman

Publication date: 25 October 1993

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(93)90030-q

zbMATH Keywords

equality constrained optimizationnull space basislocal 2-step \(Q\)- superlinear convergence rate

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

A reduced Hessian method for constrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• On the Convergence of Constrained Optimization Methods with Accurate Hessian Information on a Subspace
• A note on the computation of an orthonormal basis for the null space of a matrix
• On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
• Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
• Continuity of the null space basis and constrained optimization
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods

This page was built for publication: The local convergence of the Byrd-Schnabel algorithm for constrained optimization