J4 ›› 2013, Vol. 51 ›› Issue (01): 34-40.

Previous Articles     Next Articles

Two Sufficient Descent Conjugate Gradient Methodsfor Unconstrained Optimization

SUN Zhongbo1, DUAN Fujian2, GAO Haiyin3, YU Haiou1   

  1. 1. Department of Mathematics, College of Humanities and Sciences of Northeast Normal University,Changchun 130117, China|2. College of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin 541004, Guangxi Zhuang Autonomous Region,China|3. College of Science, Changchun University, Changchun 130022, China
  • Received:2012-03-14 Online:2013-01-26 Published:2013-01-31
  • Contact: SUN Zhongbo E-mail:szb21971@yahoo.com.cn

Abstract:

We proposed two sufficient descent conjugate gradient methods for unconstrained optimization. The sufficient descent direction is always obtained at each iteration. Under some suitable conditions, the global convergence can be induced. Numerical results show that these methods are feasible and effective.

Key words: conjugate gradient method, global convergence, unconstrained optimization

CLC Number: 

  • O224.2