摘要
This paper studies the three-term conjugate gradient method for unconstrained optimization. The method includes the classical (two-term) conjugate gradient method and the famous Beale-Powell restart algorithm as its special forms. Some mild conditions are given in this paper, which ensure the global convergence of general three-term conjugate gradient methods.
This paper studies the three-term conjugate gradient method for unconstrained optimization. The method includes the classical (two-term) conjugate gradient method and the famous Beale-Powell restart algorithm as its special forms. Some mild conditions are given in this paper, which ensure the global convergence of general three-term conjugate gradient methods.
出处
《计算数学》
CSCD
北大核心
1999年第3期355-362,共8页
Mathematica Numerica Sinica
基金
国家自然科学基金!19525101
19731010
19801033
关键词
无约束优化
共轭梯度法
线搜索
全局收敛
收敛性
Unconstrained optimization, Conjugate gradient, Line search, Global convergence
