The local convergence of the Byrd-Schnabel algorithm for constrained optimization
From MaRDI portal
Recommendations
- On the Convergence of Constrained Optimization Methods with Accurate Hessian Information on a Subspace
- An analysis of reduced Hessian methods for constrained optimization
- On the local and global convergence of a reduced Quasi-Newton method1
- scientific article; zbMATH DE number 4141429
- Local Convergence of Secant Methods for Nonlinear Constrained Optimization
Cites work
- scientific article; zbMATH DE number 4199499 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A note on the computation of an orthonormal basis for the null space of a matrix
- Continuity of the null space basis and constrained optimization
- On the Convergence of Constrained Optimization Methods with Accurate Hessian Information on a Subspace
- On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
Cited in
(3)
This page was built for publication: The local convergence of the Byrd-Schnabel algorithm for constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367977)