Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477747 | European Journal of Operational Research | 2007 | 9 Pages |
Abstract
The conjugate gradient method is a useful and powerful approach for solving large-scale minimization problems. Liu and Storey developed a conjugate gradient method, which has good numerical performance but no global convergence result under traditional line searches such as Armijo, Wolfe and Goldstein line searches. In this paper a convergent version of Liu–Storey conjugate gradient method (LS in short) is proposed for minimizing functions that have Lipschitz continuous partial derivatives. By estimating the Lipschitz constant of the derivative of objective functions, we can find an adequate step size at each iteration so as to guarantee the global convergence and improve the efficiency of LS method in practical computation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Zhen-Jun Shi, Jie Shen,