Title of article
A modified CG-DESCENT method for unconstrained optimization
Author/Authors
Dai، نويسنده , , Zhifeng and Wen، نويسنده , , Fenghua، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
10
From page
3332
To page
3341
Abstract
Recently, Hager and Zhang (2005) [11] proposed a new conjugate gradient method which generates sufficient descent direction g k T d k ≤ − 7 / 8 ‖ g k ‖ 2 , this property is independent of the line search used. In this paper, we take a modification of this method, such that the sufficient descent direction satisfies g k T d k = − ‖ g k ‖ 2 , this property is also independent of the line search used. Under appropriate conditions, we prove that the proposed method is globally convergent. Moreover, we give a sufficient condition for the global convergence of the proposed general method. The numerical results show that the proposed method is efficient.
Keywords
Sufficient descent property , global convergence , Unconstrained optimization , conjugate gradient method
Journal title
Journal of Computational and Applied Mathematics
Serial Year
2011
Journal title
Journal of Computational and Applied Mathematics
Record number
1556219
Link To Document