Global convergence of conjugate gradient method

References

• Armijo , L . 1966 . Minimization of fuctions having Lipschits continuous partial derivatives . Pacific J. Math. , 16 : 1 – 3 .
   Web of Science ®Google Scholar
• Dai , Y . 2002 . Conjugate gradient methods with Armijo-type line searches, Acta Mathematicae Applicatae Sinica . English Series , 18 : 123 – 130 .
   Google Scholar
• Dai , YH and Yuan , Y . 2005 . Analysis of monotone gradient methods . J. Ind. Manag. Optim. , 1 : 181 – 192 .
   Web of Science ®Google Scholar
• Dai , YH . 2002 . On the nonmonotone line search . J. Optim. Theory Appl. , 112 : 315 – 330 .
   Web of Science ®Google Scholar
• Dai , YH and Yuan , Y . 1999 . A nonlinear conjugate gradient method with a strong global convergence property . SIAM J. Optim. , 10 : 177 – 182 .
   Web of Science ®Google Scholar
• Fletcher , R . 1987 . Practical Method of Optimization , 2 , New York : Wiley .
   Google Scholar
• Fletcher , R and Reeves , C . 1964 . Function minimization by conjugate gradients . Computer J. , 7 : 149 – 154 .
   Web of Science ®Google Scholar
• Grippo , L and Lucidi , S . 1997 . A globally convergent version of the Polak-Ribiére conjugate gradient method . Math. Prog. , 78 : 375 – 391 .
   Web of Science ®Google Scholar
• Grippo , L , Lampariello , F and Lucidi , S . 1986 . A non-monotone linesearch technique for Newton's method . SIAM J. Numer. Anal. , 23 : 707 – 716 .
   Web of Science ®Google Scholar
• Grippo , L , Lampariello , F and Lucidi , S . 1989 . A truncated Newton method with non-monotone linesearch for unconstrained optimization . J. Optim. Theory Appl. , 69 : 401 – 419 .
   Google Scholar
• Gilbert , JC and Nocedal , J . 1992 . Global convergence properties of conjugate gradient methods for optimization . SIAM J. Optim. , 2 : 21 – 42 .
   Web of Science ®Google Scholar
• Goldstein , AA . 1965 . On steepest descent . SIAM J. Control , 3 : 147 – 151 .
   Google Scholar
• Hager , WW and Zhang , HC . 2006 . A survey of nonlinear conjugate gradient methods . Pacific J. Optim. , 2 : 35 – 58 .
   Google Scholar
• Hestenes , MR and Stiefel , E . 1952 . Method of conjugate gradient for solving linear systems . J. Res. Nat. Bur. Stand. , 49 : 409 – 436 .
   Google Scholar
• More , JJ , Garbow , BS and Hillstrom , KE . 1981 . Testing unconstrained optimization software . ACM Transactions on Mathematical Software , 7 : 17 – 41 .
   Web of Science ®Google Scholar
• Nocedal , J and Wright , JS . 1999 . Numerical Optimization , New York : Springer-Verlag . Inc
   Google Scholar
• Nocedal , J . 1992 . Theory of algorithm for unconstrained optimization, in Acta Numerica , Cambridge : Cambridge University Press .
   Google Scholar
• Polak , E and Ribiére , G . 1969 . Note sur la convergence de directions conjuguées, Rev. Francaise Infomat Recherche Operatonelle . 3e Année , 16 : 35 – 43 .
   Google Scholar
• Polyak , BT . 1969 . The conjugate gradient method in extreme problems . USSR Comp. Math. and Math. Phys. , 9 : 94 – 112 .
   Google Scholar
• Raydan , M . 1997 . The Barzilai and Borwein gradient method for the large-scale unconstrained minimization problem . SIAM J. Optim. , 7 : 26 – 33 .
   Web of Science ®Google Scholar
• Shanno , DF . 1978 . On the convergence of a new conjugate gradient algorithm . SIAM J. Numer. Anal. , 15 : 1247 – 1257 .
   Web of Science ®Google Scholar
• Shi , ZJ . 2002 . Restricted PR conjugate gradient method and its global convergence . Adv. Math. , 31 : 47 – 55 . (in Chinese)
   Google Scholar
• Shi , ZJ and Shen , J . 2005 . Convergence of descent method without line search . Appl. Math. Comput. , 167 : 94 – 107 .
   Google Scholar
• Shi , ZJ and Shen , J . 2005 . New inexact line search method for unconstrained optimization . J. Optim. Theory Appl. , 127 : 425 – 446 .
   Web of Science ®Google Scholar
• Toint , PhL . 1997 . Non-monotone trust region algorithm for nonlinear optimization subject to convex constraints . Math. Prog. , 77 : 69 – 94 .
   Web of Science ®Google Scholar
• Toint , PhL . 1996 . An assessment of non-monotone linesearch techniques for unconstrained optimization . SIAM J. Sci. Comp. , 17 : 725 – 739 .
   Web of Science ®Google Scholar
• Wolfe , P . 1969 . Convergence conditions for ascent methods . SIAM Rev. , 11 : 226 – 235 .
   Web of Science ®Google Scholar
• Yuan , Y . 1993 . Numerical Methods for Nonlinear Programming , Shanghai : Shanghai Scientific & Technical Publishers .
   Google Scholar