A Modified Liu-Storey Conjugate Gradient Method and Its Global Convergence for Unconstrained Optimization
In this paper, a sufficient descent conjugate gradient method is proposed for solving unconstrained optimization problems and a new sufficient descent search direction is proposed. Similarly, this method can be generalized to other classical conjugate gradient methods. The theoretical analysis shows that the algorithm is global convergence under some suitable conditions. Numerical results show that this new modified algorithm is effective in unconstrained optimization problems.
conjugate gradient method sufficient descent direction unconstrained optimization problems
Fujian Duan Zhongbo Sun
Department of Computational Science and Mathematics, Guilin University of Electronic Technology, Gui Department of Computational Science and Mathematics, Guilin University of Electronic Technology, Gui
国际会议
The 22nd China Control and Decision Conference(2010年中国控制与决策会议)
徐州
英文
1585-1588
2010-05-26(万方平台首次上网日期,不代表论文的发表时间)