New accelerated conjugate gradient algorithms as a modification of DaiYuan's computational scheme for unconstrained optimization

Journal of Computational and Applied Mathematics

Volumn 234, Issue 12, 2010, Pages 3397-3410

  Andrei, Neculai ^a  

^a NATIONAL INSTITUTE FOR RESEARCH AND DEVELOPMENT IN INFORMATICS   (Romania)

Author keywords

Conjugacy condition; Conjugate gradient method; Newton direction; Numerical comparisons; Sufficient descent condition; Unconstrained optimization

Indexed keywords

CONJUGACY; CONJUGACY CONDITION; NEWTON DIRECTIONS; NUMERICAL COMPARISON; UNCONSTRAINED OPTIMIZATION;

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; OPTIMIZATION;

CONJUGATE GRADIENT METHOD;

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

References (34)

1. N. Andrei, 40 conjugate gradient algorithms for unconstrained optimization. A survey on their definition, ICI Technical Report No. 13/08, March 14, 2008.
2. W.W. Hager, and H. Zhang A survey of nonlinear conjugate gradient methods Pacific J. Optim. 2 2006 35 58
3. Y.H. Dai, and Y. Yuan A nonlinear conjugate gradient method with a strong global convergence property SIAM J. Optim. 10 1999 177 182
4. Y.H. Dai, and Y. Yuan An efficient hybrid conjugate gradient method for unconstrained optimization Ann. Oper. Res. 103 2001 33 47
5. M.R. Hestenes, and E.L. Stiefel Methods of conjugate gradients for solving linear systems J. Res. Natl. Bur. Stand. 49 1952 409 436
6. E. Polak, and G. Ribire Note sur la convergence de mthodes de directions conjugue Rev. Fr. Autom. Inform. Rech. Oper. 3e Anne 16 1969 35 43
7. B.T. Polyak The conjugate gradient method in extreme problems USSR Comput. Math. Math. Phys. 9 1969 94 112
8. 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
9. D.F. Shanno, and V. Phua Algorithm 500, minimization of unconstrained multivariate functions ACM Trans. Math. Software 2 1976 87 94
10. D.C. Liu, and J. Nocedal On the limited memory BFGS method for large scale optimization Math. Program. 45 1989 503 528
11. I. Bongartz, A.R. Conn, N.I.M. Gould, and Ph.L. Toint CUTE: constrained and unconstrained testing environments ACM Trans. Math. Software 21 1995 123 160
12. N. Andrei An unconstrained optimization test functions collection Adv. Model. Optim. 10 2008 147 161
13. E.D. Dolan, and J.J. Mor Benchmarking optimization software with performance profiles Math. Program. 91 2002 201 213
14. N. Andrei Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization European J. Oper. Res. 204 2010 410 420
15. P. Wolfe Convergence conditions for ascent methods SIAM Rev. 11 1969 226 235
16. P. Wolfe Convergence conditions for ascent methods II: some corrections SIAM Rev. 13 1971 185 188
17. Y.H. Dai New properties of a nonlinear conjugate gradient method Numer. Math. 89 2001 83 98
18. Y.H. Dai, and L.Z. Liao New conjugacy conditions and related nonlinear conjugate gradient methods Appl. Math. Optim. 43 2001 87 101
19. G. Zoutendijk Nonlinear programming computational methods J. Abadie, Integer and Nonlinear Programming 1970 North-Holland Amsterdam 37 86
20. Y.H. Dai, J.Y. Han, G.H. Liu, D.F. Sun, X. Yin, and Y. Yuan Convergence properties of nonlinear conjugate gradient methods SIAM J. Optim. 10 1999 348 358
21. J. Nocedal Conjugate gradient methods and nonlinear optimization L. Adams, J.L. Nazareth, Linear and Nonlinear Conjugate GradientRelated Methods 1996 SIAM Philadelphia 9 23
22. N. Andrei Performance profiles of conjugate gradient algorithms for unconstrained optimization C.A. Floudas, P.M. Pardalos, 2nd ed. Encyclopedia of Optimization vol. P 2009 Springer New York 2938 2953
23. N. Andrei Acceleration of conjugate gradient algorithms for unconstrained optimization Appl. Math. Comput. 213 2009 361 369
24. M.J.D. Powell Restart procedures for the conjugate gradient method Math. Program. 12 1977 241 254
25. E. Birgin, and J.M. Martnez A spectral conjugate gradient method for unconstrained optimization Appl. Math. Comput. 43 2001 117 128
26. Y.H. Dai, and Q. Ni Testing different conjugate gradient methods for large-scale unconstrained optimization J. Comput. Math. 21 2003 311 320
27. S.S. Oren, and E. Spedicato Optimal conditioning of self-scaling variable metric algorithms Math. Program. 10 1976 70 90
28. J.M. Perry, A class of conjugate gradient algorithms with a two step variable metric memory, Discussion Paper 269, Center for Mathematical Studies in Economics and Management Science, Northwestern University, 1977.
29. D.F. Shanno Conjugate gradient methods with inexact searches Math. Oper. Res. 3 1978 244 256
30. D.F. Shanno On the convergence of a new conjugate gradient algorithm SIAM J. Numer. Anal. 15 1978 1247 1257
31. J.J. Mor, and D.J. Thuente Line search algorithms with guaranteed sufficient decrease ACM Trans. Math. Softw. 20 1994 286 307
32. P.C. Hansen Rank Deficient and Discrete Ill-Posed Problems 1998 SIAM Philadelphia
33. A.K. Alekseev, I.M. Navon, and J.L. Steward Comparison of advanced large-scale minimization algorithms for the solution of inverse ill-posed problems Optim. Methods Softw. 24 1 2009 63 87
34. N. Andrei, Another accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization, ICI Technical Report No. 7/2010, January 29, 2010.