Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property

Journal of Industrial and Management Optimization

Volumn 4, Issue 3, 2008, Pages 565-579

  Yu, Gaohang ^a   Guan, Lutai ^b   Li, Guoyin ^b  

^a SUN YAT SEN UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Conjugate gradient method; Global convergence; Nonconvex minimization; Unconstrained optimization

Indexed keywords

EID: 56649100496     PISSN: 15475816     EISSN: 1553166X     Source Type: Journal    
DOI: 10.3934/jimo.2008.4.565     Document Type: Article

References (22)

1. I. Bongartz, A. R. Conn, N. I. M. Gould and P. L. Toint, CUTE: constrained and unconstrained testing environments, ACM Trans. Math. Software, 21 (1995), 123-160.
2. X. Chen and J. Sun, Global convergence of a two-parameter family of conjugate gradient methods without line search, J. Comput. Appl. Math., 146 (2002), 37-45.
3. Y. Dai, Conjugate gradient methods with Armijo-type line searches, Acta Math. Appl. Sinica, English Series, 18 (2002), 123-130.
4. Y. Dai and L. Liao, New conjugacy conditions and related nonlinear conjugate gradient methods, Appl. Math. Optim., 43 (2001), 87-101.
5. Y. Dai and Y. Yuan, Analysis of monotone gradient methods, J. Ind. Manag. Optim., 1 (2005), 181-192.
6. E. D. Dolan and J. Moré, Benchmarking optimization software with performance profiles, Math. Program. Ser. A, 91 (2002), 201-213.
7. R. Fletcher and C. Reeves, Function minimization by conjugate gradients, Compute. J., 7 (1964), 149-154.
8. G. Frassoldati, L. Zanni and G. Zanghirati, New adaptive stepsize selections in gradient methods, J. Ind. Manag. Optim., 4 (2008), 299-312.
9. J. C. Gibert and J. Nocedal, Global convergence properties of conjugate gradient methods for optimization, SIAM J. Optim., 2 (1992), 21-42.
10. L. Grippo and S. Lucidi, A globally convergent version of the Polak-Ribière gradient method, Math. Prog., 78 (1997), 375-391.
11. L. Grippo and S. Lucidi, Convergence conditions, line search algorithms and trust region implementations for the Polak-Ribière conjugate gradient method, Optim. Meth. Soft., 20 (2005), 71-98.
12. W. W. Hager and H. Zhang, A new conjugate gradient method with guaranteed descent and an efficient line search, SIAM J. Optim., 16 (2005), 170-192.
13. W. W. Hager and H. Zhang, CG_DESCENT: A conjugate gradient method with guaranteed descent, ACM Trans. Math. Software, 32 (2006), 113-137.
14. E. Polak and G. Ribière, Note Sur la convergence de directions conjugèes, Rev. Francaise Informat Recherche Operationelle, 3e Annèe, 16 (1969), 35-43.
15. B. T. Polyak, The conjugate gradient method in extreme problems, USSR Comp. Math. and Math. Phys., 9 (1969), 94-112.
16. M. J. D. Powell, Nonconvex minimization calculations and the conjugate gradient method, in: Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1066 (1984), 122-141.
17. J. Sun and J. Zhang, Convergence of conjugate gradient methods without line search, Ann. Oper. Res., 103 (2001), 161-173.
18. G. Yu and L. Guan, New descent nonlinear conjugate gradient methods for large-scale unconstrained optimization, Technical report 05-10, Department of Scientific Computation and Computer Applications, Sun Yat-Sen University, 2005.
19. G. Yu, L. Guan and Z. Wei, A globally convergent Polak-Ribière-Polyak conjugate gradient method with Armijo-type line search, Numer. Math. J. Chinese Univ. English Series, 15 (2006), 357-366.
20. G. Yu, L. Guan and W. Chen, Descent spectral conjugate gradient methods for large-scale unconstrained optimization, Optim. Meth. Soft., 23 (2008), 275-293.
21. L. Zhang, W. Zhou and D. Li, A descent modified Polak-Ribiere-Polyak conjugate gradient method and its global convergence, IMA J. Numer. Anal., 26 (2006), 629-640.
22. G. Zoutendijk, Nonlinear programming computational methods, in: Integer and Nonlinear Programming, J. Abadie, ed., North-Holland, Amsterdam, 1970, 37-86.