A conjugate gradient method with quasi-Newton approximation
Koko, Jonas
Applicationes Mathematicae, Tome 27 (2000), p. 153-165 / Harvested from The Polish Digital Mathematics Library

The conjugate gradient method of Liu and Storey is an efficient minimization algorithm which uses second derivatives information, without saving matrices, by finite difference approximation. It is shown that the finite difference scheme can be removed by using a quasi-Newton approximation for computing a search direction, without loss of convergence. A conjugate gradient method based on BFGS approximation is proposed and compared with existing methods of the same class.

Publié le : 2000-01-01
EUDML-ID : urn:eudml:doc:219264
@article{bwmeta1.element.bwnjournal-article-zmv27i2p153bwm,
     author = {Jonas Koko},
     title = {A conjugate gradient method with quasi-Newton approximation},
     journal = {Applicationes Mathematicae},
     volume = {27},
     year = {2000},
     pages = {153-165},
     zbl = {0999.65049},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-zmv27i2p153bwm}
}
Koko, Jonas. A conjugate gradient method with quasi-Newton approximation. Applicationes Mathematicae, Tome 27 (2000) pp. 153-165. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-zmv27i2p153bwm/

[000] [1] C. G. Broyden, The convergence of a class of double-rank minimization algorithms, J. Inst. Math. Appl. 6 (1970), 60-76. | Zbl 0223.65023

[001] [2] J. E. Dennis and J. J. Moré, Quasi-Newton methods, motivations and theory, SIAM Rev. 19 (1977), 46-89. | Zbl 0356.65041

[002] [3] R. Fletcher and C. M. Reeves, Function minimization by conjugate gradient, Computer J. 7 (1964), 143-154. | Zbl 0132.11701

[003] [4] J. C. Gilbert and C. Lemarechal, The modules M1QN2, N1QN2, M1QN3 and N1QN3, INRIA, technical report, 1989.

[004] [5] J. C. Gilbert and J. Nocedal, Global convergence properties of conjugate gradient methods for optimization, SIAM J. Optim. 2 (1992), 21-42. | Zbl 0767.90082

[005] [6] M. Hestenes and E. Stiefel, Methods of conjugate gradient for solving linear systems, J. Res. Nat. Bureau Standards B48 (1952), 409-436. | Zbl 0048.09901

[006] [7] Y. F. Hu and C. Storey, Efficient generalized conjugate gradient algorithms, Part 2: Implementation, J. Optim. Theory Appl. 69 (1991), 139-152.

[007] [8] Y. F. Hu and C. Storey, Preconditioned low-order Newton methods, ibid. 79 (1993), 311-331.

[008] [9] Y. Liu and C. Storey, Efficient generalized conjugate gradient algorithms, Part 1: Theory, ibid. 69 (1991), 129-137.

[009] [10] J. L. Nazareth, The method of successive affine reduction for nonlinear minimization, Math. Programming 35 (1985), 97-109. | Zbl 0621.90076

[010] [11] J. L. Nazareth, Conjugate gradient methods less dependent on conjugacy, SIAM Rev. 28 (1986), 501-511. | Zbl 0625.90077

[011] [12] E. Polak and G. Ribière, Note sur la convergence des méthodes de directions conjuguées, RAIRO Rech. Opér. 16 (1969), 35-43. | Zbl 0174.48001