On the Convergence of a New Conjugate Gradient Algorithm
Author:
- D. F. ShannoDSD. F. Shanno
- 1 December 1978
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 15 (6) , 1247-1257
Abstract
This paper studies the convergence of a conjugate gradient algorithm proposed in a recent paper by Shanno. It is shown that under loose step length criteria similar to but slightly different from those of Lenard, the method converges to the minimizes of a convex function with a strictly bounded Hessian. Further, it is shown that for general functions that are bounded from below with bounded level sets and bounded second partial derivatives, false convergence in the sense that the sequence of approximations to the minimum converges to a point at which the gradient is bounded away from zero is impossible.Keywords
This publication has 9 references indexed in Scilit:
- Conjugate Gradient Methods with Inexact SearchesMathematics of Operations Research, 1978
- Restart procedures for the conjugate gradient methodMathematical Programming, 1977
- Optimal conditioning of self-scaling variable Metric algorithmsMathematical Programming, 1976
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]ACM Transactions on Mathematical Software, 1976
- Optimally conditioned optimization algorithms without line searchesMathematical Programming, 1975
- Practical convergence conditions for unconstrained optimizationMathematical Programming, 1973
- On search directions for minimization algorithmsMathematical Programming, 1973
- An effective algorithm for minimizationNumerische Mathematik, 1967
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952