The conjugate gradient method is particularly useful for minimizing functions of very many variables because it does not require the storage of any matrices. However the rate of convergence of the algorithm is only linear unless the iterative procedure is “restarted” occasionally. At present it is usual to restart everyn or (n + 1) iterations, wheren is the number of variables, but it is known that the frequency of restarts should depend on the objective function. Therefore the main purpose of this paper is to provide an algorithm with a restart procedure that takes account of the objective function automatically. Another purpose is to study a multiplying factor that occurs in the definition of the search direction of each iteration. Various expressions for this factor have been proposed and often it does not matter which one is used. However now some reasons are given in favour of one of these expressions. Several numerical examples are reported in support of the conclusions of this paper.
[1]
Roger Fletcher,et al.
A Rapidly Convergent Descent Method for Minimization
,
1963,
Comput. J..
[2]
C. M. Reeves,et al.
Function minimization by conjugate gradients
,
1964,
Comput. J..
[3]
H. Crowder,et al.
Linear convergence of the conjugate gradient method
,
1972
.
[4]
E. Polak,et al.
Computational methods in optimization : a unified approach
,
1972
.
[5]
E. Polak.
Introduction to linear and nonlinear programming
,
1973
.
[6]
M. J. D. Powell,et al.
Some convergence properties of the conjugate gradient method
,
1976,
Math. Program..