A descent modified Polak-Ribière-Polyak conjugate gradient method and its global convergence

IMA Journal of Numerical Analysis

Volumn 26, Issue 4, 2006, Pages 629-640

  Zhang, Li ^a   Zhou, Weijun ^b   Li, Dong Hui ^b  

^a CHANGSHA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b HUNAN UNIVERSITY   (China)

Author keywords

Armijo type line search; Global convergence; MPRP method; PRP method

Indexed keywords

NUMERICAL METHODS;

EXACT LINE SEARCHES; GLOBAL CONVER-GENCE; GLOBALLY CONVERGENT; LINE SEARCHES; MPRP METHOD; NUMERICAL EXPERIMENTS; OBJECTIVE FUNCTIONS; PRP METHODS;

CONJUGATE GRADIENT METHOD;

EID: 33749621811     PISSN: 02724979     EISSN: 14643642     Source Type: Journal    
DOI: 10.1093/imanum/drl016     Document Type: Article

References (33)

1. AL-BAALI, M. (1985) Descent property and global convergence of the Fletcher-Reeves method with inexact line search. IMA J. Numer. Anal., 5, 121-124.
2. BEALE, E. M. L. (1972) A derivation of conjugate gradients. Numerical Methods for Nonlinear Optimization (F. A. Lootsma ed.). New York: Academic Press, pp. 39-43.
3. BONGARTZ, K. E., CONN, A. R., GOULD, N. I. M. & TOINT, P. L. (1995) CUTE: constrained and unconstrained testing environments. ACM Trans. Math. Softw., 21, 123-160.
4. DAI, Y. H. (1998) Some new properties of a nonlinear conjugate gradient method. Research Report ICM-98-010. Beijing: Insititute of Computational Mathematics and Scientific/Engineery Computing, Chinese Academy of Sciences.
5. DAI, Y. H. & YUAN, Y. (1996a) Convergence properties of the conjugate descent method. Adv. Math., 25, 552-562.
6. DAI, Y. H. & YUAN, Y. (1996b) Convergence properties of the Fletcher-Reeves method. IMA J. Numer. Anal., 16, 155-164.
7. DAI, Y. H. & YUAN, Y. (2000) A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim., 10, 177-182.
8. DENNIS, J. E. & MORÉ, J. J. (1974) A characterization of superlinear convergence and its application to quasi-Newton methods. Math. Comput., 28, 549-560.
9. DENNIS, J. E. & MORÉ, J. J. (1977) Quasi-Newton method, motivation and theory. SIAM Rev., 19, 46-89.
10. DIXON, L. C. W. (1970) Nonlinear optimization: a survey of the state of the art. Software for Numerical Mathematics (D. J. Evans ed.). New York: Academic Press, pp. 193-216.
11. DOLAN, E. D. & MORÉ, J. J. (2002) Benchmarking optimization software with performance profiles. Math. Program., 91, 201-213.
12. FLETCHER, R. (1987) Practical Methods of Optimization, Vol I: Unconstrained Optimization. New York: Wiley.
13. FLETCHER, R. & REEVES, C. (1964) Function minimization by conjugate gradients. J. Comput., 7, 149-154.
14. GILBERT, J. C. & NOCEDAL, J. (1992) Global convergence properties of conjugate gradient methods for optimization. SIAM. J. Optim., 2, 21-42.
15. GRIPPO, L. & LUCIDI, S. (1997) A globally convergent version of the Polak-Ribiére gradient method. Math. Program., 78, 375-391.
16. HAGER, W. W. & ZHANG, H. (2005) A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim., 16, 170-192.
17. HAGER, W. W. & ZHANG, H. (2006) A survey of nonlinear conjugate gradient methods. Pac. J. Optim., 2, 35-58.
18. HESTENES, M. R. & STIEFEL, E. L. (1952) Method of conjugate gradient for solving linear systems. J. Res. Natl. Bur. Stand., 49, 409-432.
19. HU, Y. & STOREY, C. (1991) Global convergence results for conjugate gradient methods. J. Optim. Theory Appl., 71, 399-405.
20. LIU, D. C. & NOCEDAL, J. (1989) On the limited memory BFGS method for large scale optimization methods. Math. Program., 45, 503-5280.
21. LIU, G., HAN, J. & YIN, H. (1995) Global convergence of the Fletcher-Reeves algorithm with inexact line search. Appl. Math. J. Chin. Univ. Ser. B, 10, 75-82.
22. MORÉ, J. J. & THUENTE, D. J. (1994) Line search algorithms with guaranteed sufficient decrease. ACM Trans. Math. Softw., 20, 286-307.
23. NOCEDAL, J. (1980) Updating quasi-Newton matrixes with limited storage. Math. Comput., 35, 773-782.
24. NOCEDAL, J. (1996) Conjugate gradient methods and nonlinear optimization. Linear and Nonlinear Conjugate Gradient-Related Method (L. Adams & J. L. Nazareth eds). Philadelphia: SIAM, pp. 9-23.
25. POLAK, B. & RIBIERE, G. (1969) Note surla convergence des méthodes de directions conjuguées. Rev. Fr. Imform. Rech. Oper., 16, 35-43.
26. POLAK, E. (1997) Optimization: Algorithms and Consistent Approximations. New York: Springer.
27. POLYAK, B. T. (1969) The conjugate gradient method in extreme problems. USSR Comput. Math. Math. Phys., 9, 94-112.
28. POWELL, M. J. D. (1984) Nonconvex Minimization Calculations and the Conjugate Gradient Method. Lecture Notes in Mathematics, vol. 1066. pp. 121-141.
29. POWELL, M. J. D. (1986) Convergence properties of algorithms for nonlinear optimization. SIAM Rev., 28, 487-500.
30. SHANNO, D. F. (1978) Conjugate gradient methods with inexact searches. Math. Oper. Res., 3, 244-256.
31. SUN, J. & ZHANG, J. (2001) Convergence of conjugate gradient methods without line search. Ann. Oper. Res., 103, 161-173.
32. TOUATI-AHMED, D. & STOREY, C. (1990) Efficient hybrid conjugate gradient techniques. J. Optim. Theory Appl., 64, 379-397.
33. ZOUTENDIJK, G. (1970) Nonlinear programming, computational methods. Integer and Nonlinear Programming (J. Abadie ed.). North-Holland, pp. 37-86.