By Topic

A modified Liu-Storey conjugate gradient method and its global convergence for unconstrained optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fujian Duan ; Dept. of Comput. Sci. & Math., Guilin Univ. of Electron. Technol., Guilin, China ; Zhongbo Sun

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.

Published in:

Control and Decision Conference (CCDC), 2010 Chinese

Date of Conference:

26-28 May 2010