[1]Cohen A I. Stepsize analysis for descent methods.J Optim Theory Appl, 1981, 33: 187-205

[2]Dai Y H, Yuan Y. Convergence properties of the FletcherReeves method. IMA J of Numer Anal, 1996, 16: 155-164

[3]Dai Y H,  Yuan Y. A nonlinear conjugate gradient method with a strong global convergence property. SIAM J of Optimization, 1999, 10: 177-1 82

[4]Dixon L C W. Conjugate directions without line searches. Journal of the Institute of Mathematics and Its Applications, 1973, 11: 317-328

[5]Fletcher R. Practical Methods of Optimization: Unconstrained Optimization. New York: John Wiley & Sons, 1987

[6]Gilbert J C,  Nocedal J. Global convergence properties of conjugate gradi ent methods for optimization. SIAM  J Optimization, 1992, 2:  21-42

[7]Grippo L,  Lucidi S. A globally convergent version of the PolakRibiére conjugate gradient method. Math Prog,  1997, 78
[ST BZ]: 375-391

[8]Grippo L, Lampariello F,  Lucidi S. A class of nonmonotone stability methods in unconstrained optimization.Numerische Mathematik, 1991, 62: 779-805

[9]Huang H Y,  Chambliss J P. Quadratically convergent algorithms and oned imensional search schemes. J Optim Theory  Appl, 1973, 11: 175-188

[10]Hu Y F,  Storey C. Global convergence restart for conjugate gradient methods. J Optim Theory Appl, 1991, 71: 399-405

[11]时贞军. 限制PR共轭梯度法及其全局收敛性. 数学进展, 2002, 31(1):47-55

[12]时贞军. 改进HS共轭梯度法及其全局收敛性. 计算数学, 2001, 23(4):393-406