On the rate of superlinear convergence of a class of variable metric methods
From MaRDI portal
Publication:1152205
DOI10.1007/BF01396414zbMath0459.65043MaRDI QIDQ1152205
Publication date: 1980
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/186292
variable metric methodsquasi-Newton methodssuperlinear convergenceBroyden-Fletcher-Goldfarb-Shanno methodrestricted Broyden methods
Related Items
The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations, The convergence rate of a restart MFR conjugate gradient method with inexact line search, \(n\)-step quadratic convergence of the MPRP method with a restart strategy, A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems, Optimalr-order of an adjoint Broyden method without the assumption of linearly independent steps, The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems, Rate of Convergence of a Restarted CG-DESCENT Method, The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden
Cites Work
- Unnamed Item
- On the order of convergence of certain quasi-Newton methods
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- Die Konvergenzordnung des Fletcher-Powell-Algorithmus
- On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
- A Rapidly Convergent Descent Method for Minimization
- Quasi-Newton Methods and their Application to Function Minimisation
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Conditioning of Quasi-Newton Methods for Function Minimization
