论文信息 - Global convergence of a two-parameter family of conjugate gradient methods without line search

Global convergence of a two-parameter family of conjugate gradient methods without line search

We study the global convergence of a two-parameter family of conjugate gradient methods in which the line search procedure is replaced by a fixed formula of stepsize. This character is of significance if the line search is expensive in a particular application. In addition to the convergence results, we present computational results for various conjugate gradient methods without line search including those discussed by Sun and Zhang. (Ann. Oper. Res. 103 (2001) 161-173).

Jie Sun | Xiongda Chen

[1] C. M. Reeves,et al. Function minimization by conjugate gradients , 1964, Comput. J..

[2] Jorge J. Moré,et al. Testing Unconstrained Optimization Software , 1981, TOMS.

[3] Ya-Xiang Yuan,et al. A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property , 1999, SIAM J. Optim..

[4] Jiapu Zhang,et al. Global Convergence of Conjugate Gradient Methods without Line Search , 2001, Ann. Oper. Res..

[5] C. Storey,et al. Efficient generalized conjugate gradient algorithms, part 1: Theory , 1991 .

[6] Boris Polyak. The conjugate gradient method in extremal problems , 1969 .