Global convergence of the fletcher-reeves algorithm with inexact linesearch
- 18 Downloads
In this paper, we investigate the convergence properties of the Fletcher-Reeves algorithm. Under conditions weaker than those in a paper of M. Al-Baali, we get the global convergence of the Fletcher-Reeves algorithm with a low-accuracy inexact linesearch.
1991 MR Subject Classification90C30
KeywordsFletcher-Reeves algorithm inexact linesearch global convergence
Unable to display preview. Download preview PDF.
- Dixon, L.C.W., Duksbury, P.G. and Singh, P., A new three-term conjugate gradient method, Technical Report No. 130, Numerical Optimization Centre, Hatfield Polytechnic, Hatfield, Hertford Shire, England, 1985.Google Scholar
- Hayami, K. and Harada, N.,On the effectiveness of the diagonally scaled conjugate gradient algorithm on vector computers, Trans. Inform. Process. Soc. Japan,30 (1989), 1164–1375.Google Scholar
- Powell, M.J.D., Nonconvex minimization calculations and the conjugate gradient method, in: Numerical Analysis (Griffiths, D.F., ed.), Dundee, 1983, pp. 122–141.Google Scholar