摘要
This paper presents a modified HS conjugate gradient method for unconstrained optimization problem. The convergence of this algorithm is analyzed. Numerical experiments show that the algorithm is efficient by comparing with HS conjugate gradient method under Armijo line search.
This paper presents a modified HS conjugate gradient method for unconstrained optimization problem. The convergence of this algorithm is analyzed. Numerical experiments show that the algorithm is efficient by comparing with HS conjugate gradient method under Armijo line search.
出处
《计算数学》
CSCD
北大核心
2001年第4期393-406,共14页
Mathematica Numerica Sinica
基金
国家自然科学基金(19871049)
山东省自然科学基金(Q98A06114)资助项目.
