A conjugate gradient method with descent direction for unconstrained optimization

Journal of Computational and Applied Mathematics

Volumn 233, Issue 2, 2009, Pages 519-530

  Yuan, Gonglin ^a   Lu, Xiwen ^b   Wei, Zengxin ^a  

^a GUANGXI UNIVERSITY   (China)

^b EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Conjugate gradient method; Global convergence; Line search; Search direction; Unconstrained optimization

Indexed keywords

CONVERGENT RATE; GLOBAL CONVERGENCE; LINE SEARCH; LINE SEARCH TECHNIQUE; LINE SEARCHES; NUMERICAL RESULTS; SEARCH DIRECTION; STEEPEST DESCENT; TRUST REGION; UNCONSTRAINED OPTIMIZATION; UNCONSTRAINED OPTIMIZATION PROBLEMS;

OPTIMIZATION;

CONJUGATE GRADIENT METHOD;

EID: 69249208617     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2009.08.001     Document Type: Article

References (36)

1. Dai Y. A nonmonotone conjugate gradient algorithm for unconstrained optimization. J. Syst. Sci. Complex. 15 (2002) 139-145
2. Wei Z., Li G., and Qi L. New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems. Appl. Math. Comput. 179 (2006) 407-430
3. Wei Z., Yao S., and Liu L. The convergence properties of some new conjugate gradient methods. Appl. Math. Comput. 183 (2006) 1341-1350
4. Yuan G.L., and Lu X.W. A new line search method with trust region for unconstrained optimization. Commun. Appl. Nonlinear Anal. 1 15 (2008) 35-49
5. Yuan G.L., Lu X.W., and Wei Z.X. New two-point stepsize gradient methods for solving unconstrained optimization problems. Natur. Sci. J. Xiangton Univ. 1 29 (2007) 13-15
6. Yuan G.L., and Wei Z.X. New line search methods for unconstrained optimization. J. Korean Statist. Soc. 38 (2009) 29-39
7. Yuan G.L., and Wei Z.X. The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions. Acta Math. Sin. (Engl. Ser.) 1 24 (2008) 35-42
8. G.L. Yuan, Z.X. Wei, Convergence analysis of a modified BFGS method on convex minimizations, Comput. Optim. Appl., doi:10.1007/s10589-008-9219-0
9. Yuan G.L., and Wei Z.X. A rank-one fitting method for unconstrained optimization problems. Math. Appl. 1 22 (2009) 118-122
10. Dai Y., and Yuan Y. A nonlinear conjugate gradient with a strong global convergence properties. SIAM J. Optim. 10 (2000) 177-182
11. Fletcher R. Practical Method of Optimization, Vol I: Unconstrained Optimization. 2nd ed. (1997), Wiley, New York
12. Fletcher R., and Reeves C. Function minimization bu conjugate gradients. Compute. J. 7 (1964) 149-154
13. Hestenes M.R., and Stiefel E. Method of conjugate gradient for solving linear equations. J, Res. Nat. Bur. Stand. 49 (1952) 409-436
14. Liu Y., and Storey C. Effcient generalized conjugate gradient algorithms, part 1: Theory. J. Optim. Theory Appl. 69 (1992) 17-41
15. Polak E., and Ribiere G. Note sur la xonvergence de directions conjugees. Rev. Francaise informat Recherche Operatinelle, 3e Annee 16 (1969) 35-43
16. Dai Y., and Yuan Y. Nonlinear Conjugate Gradient Methods (2000), Science Press of Shanghai, Shanghai
17. Yuan Y., and Sun W. Theory and Methods of Optimization (1999), Science Press of China, Beijing
18. Powell M.J.D. Nonconvex minimization calculations and the conjugate gradient method. Lecture Notes in Mathematics vol. 1066 (1984), Spinger-Verlag, Berlin 122-141
19. Gibert J.C., and Nocedal J. Global convergence properties of conugate gradient methods for optimization. SIAM J. Optimiz. 2 (1992) 21-42
20. Dai Y., and Yuan Y. An efficient hybrid conjugate gradient method for unconstrained optimization. Ann. Oper. Res. 103 (2001) 33-47
21. Ahmed T., and Storey D. Efficient hybrid conjugate gradient techniques. J. Optim. Theory Appl. 64 (1990) 379-394
22. Al-Baali A. Descent property and global convergence of the Flecher-Reeves method with inexact line search. IMA J. Numer. Anal. 5 (1985) 121-124
23. Hu Y.F., and Storey C. Global convergence result for conjugate method. J. Optim. Theory Appl. 71 (1991) 399-405
24. Grippo L., and Lucidi S. A globally convergent version of the Polak-Ribière gradient method. Math. Program. 78 (1997) 375-391
25. Hager W.W., and Zhang H.C. A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 1 16 (2005) 170-192
26. G.H. Yu, Nonlinear self-scaling conjugate gradient methods for large-scale optimization problems, Thesis of Doctor's Degree, Sun Yat-Sen University, 2007
27. Yuan G.L. Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems. Optim. Lett. 3 (2009) 11-21
28. Yuan G.L., and Lu X.W. A modified PRP conjugate gradient method. Ann. Oper. Res. 166 (2009) 73-90
29. Zhang L., Zhou W., and Li D. A descent modified Polak-Ribière-Polyak conjugate method and its global convergence. IMA J. Numer. Anal. 26 (2006) 629-649
30. Zoutendijk G. Nonlinear programming computational methods. In: Abadie J. (Ed). Integer and Nonlinear Programming (1970), NorthHolllad, Amsterdam 37-86
31. Ortega J.M., and Rheinboldt W.C. Iterative Solution of Nonlinear Equation in Seveal Variables (1970), Academic Press
32. Rockafellar R.T. Convex Analysis (1970), Princeton University Press
33. Moré J.J., Garbow B.S., and Hillstrome K.E. Testing unconstrained optimization software. ACM Trans. Math. Software. 7 (1981) 17-41
34. Dolan E.D., and Moré J.J. Benchmarking optimization software with performance profiles. Math. Program. 91 (2002) 201-213
35. Shi Z.J. Convergence of line search methods for unconstrained optimization. Appl. Math. Comput. 157 (2004) 393-405
36. Zhang H.C., and Hager W.W. A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim 4 14 (2004) 1043-1056