Two Hybrid Conjugate Gradient Method and Its Global Convergence for Unconstrained Optimization
In this paper, we propose two hybrid conjugate gradient methods, which produce sufficient descent direction at every iteration. The theoretical analysis shows that the algorithm is global convergence under some suitable conditions. The numerical results show that both hybrid algorithms are efficient for the given test problems from the Matlab library.
Hybrid conjugate gradient method Unconstrained optimization Sufficient descent direction
Zhongbo Sun
Department of Mathematical Education, College of Humanities and Sciences of Northeast Normal University, Boshuo Road 1488, Changchun, China
国际会议
2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)
四川绵阳
英文
828-832
2011-05-23(万方平台首次上网日期,不代表论文的发表时间)