On the relation between quadratic termination and convergence properties of minimization algorithms
- 1 December 1977
- journal article
- Published by Springer Nature in Numerische Mathematik
- Vol. 28 (4) , 367-391
- https://doi.org/10.1007/bf01404342
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Convergence conditions for restarted conjugate gradient methods with inaccurate line searchesMathematical Programming, 1976
- Practical convergence conditions for the Davidon-Fletcher-Powell methodMathematical Programming, 1975
- Practical convergence conditions for unconstrained optimizationMathematical Programming, 1973
- Methods of conjugate directions versus quasi-Newton methodsMathematical Programming, 1972
- Rate of Convergence of Several Conjugate Gradient AlgorithmsSIAM Journal on Numerical Analysis, 1972
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General ConsiderationsIMA Journal of Applied Mathematics, 1970
- The Conjugate Gradient Method for Linear and Nonlinear Operator EquationsSIAM Journal on Numerical Analysis, 1967
- Quasi-Newton methods and their application to function minimisationMathematics of Computation, 1967
- Function minimization by conjugate gradientsThe Computer Journal, 1964
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963