A New Family Sufficient Descent Conjugate Gradient Methods for Unconstrained Optimization

摘要：

In this paper, a new family modified descent conjugate gradient methods are proposed for solving unconstrained optimization problems. We develop a new sufficient descent direction at every iteration. Under some suitable conditions, theoretical analysis shows that the algorithm is global convergence. Numerical results show that this method is effective in unconstrained minimizing optimization problems.

关键词： conjugate gradient method sufficient descent direction unconstrained minimizing optimization problems

作者: Zhongbo Sun Tianxiao Zhu Shiyou Weng Haiyin Gao

作者单位: College of Humanities and Sciences of Northeast Normal University, Changchun, 130117, China College of Science, Changchun University, Changchun, 130022, China Department of basic of course Suzhou Vocational University ,Suzhou, China

会议类型: 国际会议

会议名称: The 31st Chinese Control Conference(第三十一届中国控制会议)

会议地点: 合肥

会议语种:英文

页码: 2532-2536

在线出版日期: 2012-07-01（万方平台首次上网日期，不代表论文的发表时间）