A Sufficient Descent Hybrid Conjugate Gradient Method and Its Global Convergence for Unconstrained Optimization
In this paper, a modi.ed hybrid conjugate gradient method is proposed for solving unconstrained optimization problems and a new suf.cient descent direction is proposed.The theoretical analysis shows that the algorithm is global convergence under some suitable conditions. Numerical results show that this algorithm is effective in unconstrained optimization problems.
Hybrid conjugate gradient method Sufficient descent direction Unconstrained optimization problem
Zhongbo Sun Tianxiao Zhu Haiyin Gao
Department of Mathematical Education, Collegeof Humanities and Sciences of Northeast Normal Universi Department of Mathematicsand Applied Mathematics, Changchun University, Changchun, 6543, China Department of Mathematics and Applied Mathematics, Changchun University, Changchun, 6543, China
国际会议
The 24th Chinese Control and Decision Conference (第24届中国控制与决策学术年会 2012 CCDC)
太原
英文
735-739
2012-05-23(万方平台首次上网日期,不代表论文的发表时间)