论文信息 - A new three-term conjugate gradient method

A new three-term conjugate gradient method

In this paper, we describe an implementation and give performance results for a conjugate gradient algorithm for unconstrained optimization. The algorithm is based upon the Nazareth three-term formula and incorporates Allwright preconditioning matrices and restart tests. The performance results for this combination compare favorably with existing codes.

L. Dixon | P. Ducksbury | P. Singh | P. Singh

[1] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .

[2] C. M. Reeves,et al. Function minimization by conjugate gradients , 1964, Comput. J..

[3] L. Armijo. Minimization of functions having Lipschitz continuous first partial derivatives. , 1966 .

[4] P. Wolfe. Convergence Conditions for Ascent Methods. II , 1969 .

[5] E. Polak,et al. Note sur la convergence de méthodes de directions conjuguées , 1969 .

[6] A. I. Cohen. Rate of convergence of several conjugate gradient algorithms. , 1972 .

[7] L. C. W. Dixon. Conjugate Directions without Linear Searches , 1973 .

[8] M. J. D. Powell,et al. Restart procedures for the conjugate gradient method , 1977, Math. Program..

[9] L. Nazareth. A conjugate direction algorithm without line searches , 1977 .

[10] J. Nocedal. ON THE METHOD OF CONJUGATE GRADIENTS FOR FUNCTION MINIMIZATION , 1978 .

[11] Albert G. Buckley,et al. QN-like variable storage conjugate gradients , 1983, Math. Program..