Global convergence of the fletcher-reeves algorithm with inexact linesearch

Al-Baali, M., Descent property and global convergence of the Fletcher-Reeves method with inexact linesearch,IMA Numer. Anal.,5 (1985), 121–124.

Cloutier, J.R. and Wilson, R.F., Periodically preconditioned congate-restoration algorithms,J. Optim. theory Appl.,70 (1991), 79–95.

Cohan, A., Rate of convergence of several conjugate gradient algorithms,SIAM J. Numer. Anal.,9 (1972), 248–259.

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.

Fletcher, R. and Reeves, C.M., Function minimization by conjugate gradients,Comput. J.,7 (1964), 149–154.

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.

Liu, Y. and Storey, C., Eficient generalized gradient algorithm I: Theory,J. Optim. Theory Appl.,69 (1991), 129–137.

Nazareth, J.L., Conjugate gradient methods less dependent on conjugacy,SIAM Rev.,28 (1986), 501–511.

Powell, M.J.D., Nonconvex minimization calculations and the conjugate gradient method, in: Numerical Analysis (Griffiths, D.F., ed.), Dundee, 1983, pp. 122–141.

Shanno, D.F., Global convergent conjugate gradient algorithms,Math. Programming,33 (1985), 61–67

Touati-Ahmed, D. and Storey, C., Efficient hybird conjugate gradient techniques,J. Optim. Theory Appl.,64 (1990), 379–397.