Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search

Numerische Mathematik

Volumn 104, Issue 4, 2006, Pages 561-572

  Zhang, Li ^a   Zhou, Weijun ^a   Li, Donghui ^b  

^a CHANGSHA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b HUNAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33749239442     PISSN: 0029599X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00211-006-0028-z     Document Type: Article

References (33)

1. Al-Baali, M.: Descent property and global convergence of the Fletcher-Reeves method with inexact line search. IMA J. Numer. Anal. 5, 121-124 (1985)
2. Andrei, N.: Scaled conjugate gradient algorithms for unconstrained optimization. Comput. Optim. Appl. (to apper)
3. Birgin, E., Martínez, J.M.: A spectral conjugate gradient method for unconstrained optimization. Appl. Math. Optim. 43, 117-128 (2001)
4. Bongartz, K.E., Conn, A.R., Gould, N.I.M., Toint, P.L.: CUTE: constrained and unconstrained testing environments. ACM Trans. Math. Softw. 21, 123-160 (1995)
5. Dai, Y.H., Yuan, Y.: Convergence properties of the conjugate descent method. Adv. Math. 25, 552-562 (1996)
6. Dai, Y.H., Yuan, Y.: Convergence properties of the Fletcher-Reeves method. IMA I Numer. Anal. 16, 155-164 (1996)
7. Dai, Y.H., Yuan, Y: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10, 177-182 (2000)
8. Dai, Y.H.: Some new properties of a nonlinear conjugate gradient method. Research report ICM-98-010, Insititute of Computational Mathematics and Scientific/Engineering Computing. Chinese Academy of Sciences, Beijing (1998)
9. Dixon, L.C.W.: Nonlinear optimization: a survey of the state of the art. In: Evans, D.J. (eds.) Software for Numerical Mathematics pp. 193-216. Academic, New York (1970)
10. Dolan E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201-213 (2002)
11. Fletcher, R.: Practical Methods of Optimization, Unconstrained Optimization, vol. I. Wiley, New York (1987)
12. Fletcher, R., Reeves, C.: Function minimization by conjugate gradients. J. Comput. 7, 149-154 (1964)
13. Gilbert, J.C., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM. J. Optim. 2, 21-42 (1992)
14. Grippo, L., Lucidi, S.: A globally convergent version of the Polak-Ribiére gradient method. Math. Program. 78, 375-391 (1997)
15. Hager, W. W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170-192 (2005)
16. Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pacific J. Optim. 2, 35-58 (2006)
17. Hestenes, M.R., Stiefel, E.L.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. Sect. B. 49, 409-432 (1952)
18. Hu, Y., Storey, C.: Global convergence results for conjugate gradient methods. J. Optim. Theory Appl. 71, 399-405 (1991)
19. Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization methods. Math. Program. 45, 503-528 (1989)
20. Liu, G., Han, J., Yin, H.: Global convergence of the Fletcher-Reeves algorithm with inexact line search. Appl. Math. J. Chin. Univ. Ser. B. 10, 75-82 (1995)
21. Moré, J.J., Garbow, B.S., Hillstrome, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17-41 (1981)
22. Moré, J.J., Thuente, D.J.: Line search algorithms with guaranteed sufficient decrease. ACM Trans. Math. Softw. 20, 286-307 (1994)
23. Nocedal, J.: Conjugate gradient methods and nonlinear optimization. In: Adams, L., Nazareth, J.L. (eds.) Linear and Nonlinear Conjugate Gradient-Related Methods, pp. 9-23. SIAM, Philadelphia (1996)
24. Polak, E.: Optimization: Algorithms and Consistent Approximations. Springer, Berlin Heidelberg New York (1997)
25. Polak, B., Ribiere, G.: Note surla convergence des méthodes de directions conjuguées. Rev. Francaise Imformat Recherche Opertionelle 16, 35-43 (1969)
26. Polyak, B.T.: The conjugate gradient method in extreme problems. USSR Comp. Math. Math. Phys. 9, 94-112 (1969)
27. Powell, M.J.D.: Nonconvex minimization calculations and the conjugate gradient method. In: Lecture Notes in Mathematics 1066, 121-141 (1984)
28. Powell, M.J.D.: Convergence properties of algorithms for nonlinear optimization. SIAM Rev. 28, 487-500 (1986)
29. Raydan, M.: The Barzilain and Borwein gradient method for the large unconstrained minimization problem. SIAM J. Optim. 7, 26-33 (1997)
30. Sun, J., Zhang, J.:Convergence of conjugate gradient methods without line search. Ann. Oper. Res. 103, 161-173 (2001)
31. Touati-Ahmed, D., Storey, C.: Efficient hybrid conjugate gradient techniques. J. Optim. Theory Appl. 64, 379-397 (1990)
32. Zhang, L., Zhou, W.J., Li, D.H.: A descent modified Polak-Ribière- Polyak conjugate gradient method and its global convergence. IMA J. Numer. Anal, (to appear)
33. Zoutendijk, G. : Nonlinear programming, computational methods. In: Abadie, X (eds.) Integer and Nonlinear Programming, pp. 37-86. North-Holland, Amsterdam (1970)