On the rate of superlinear convergence of a class of variable metric methods
- 1 September 1980
- journal article
- Published by Springer Nature in Numerische Mathematik
- Vol. 35 (3) , 293-313
- https://doi.org/10.1007/bf01396414
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Global and superlinear convergence of a class of variable metric methodsPublished by Springer Nature ,1981
- On the convergence rate of imperfect minimization algorithms in Broyden'sβ-classMathematical Programming, 1975
- Variable metric algorithms: Necessary and sufficient conditions for identical behavior of nonquadratic functionsJournal of Optimization Theory and Applications, 1972
- Unified approach to quadratically convergent algorithms for function minimizationJournal of Optimization Theory and Applications, 1970
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General ConsiderationsIMA Journal of Applied Mathematics, 1970
- A new approach to variable metric algorithmsThe Computer Journal, 1970
- A family of variable-metric methods derived by variational meansMathematics of Computation, 1970
- Conditioning of quasi-Newton methods for function minimizationMathematics of Computation, 1970
- Quasi-Newton methods and their application to function minimisationMathematics of Computation, 1967
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963