On the rate of superlinear convergence of a class of variable metric methods
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3323071 (Why is no real title available?)
- A Family of Variable-Metric Methods Derived by Variational Means
- A Rapidly Convergent Descent Method for Minimization
- A new approach to variable metric algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- Die Konvergenzordnung des Fletcher-Powell-Algorithmus
- On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
- On the order of convergence of certain quasi-Newton methods
- Quasi-Newton Methods and their Application to Function Minimisation
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
Cited in
(8)- \(n\)-step quadratic convergence of the MPRP method with a restart strategy
- The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
- Rate of convergence of a restarted CG-DESCENT method
- The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems
- The Hager-Zhang conjugate gradient algorithm for large-scale nonlinear equations
- Optimalr-order of an adjoint Broyden method without the assumption of linearly independent steps
- The convergence rate of a restart MFR conjugate gradient method with inexact line search
This page was built for publication: On the rate of superlinear convergence of a class of variable metric methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152205)
