Conjugate gradient methods are widely used f or solving large-scale unconstrained optimization problems because they do not need the storage of matrices. In this paper, we propose a general form of three-term conjugate gradient methods which always generate a sufficient descent direction. We give a sufficient condition for the global convergence of the proposed method. Moreover, we present a specific three-term conjugate gradient method based on the multistep quasi-Newton method. Finally, some numerical results of the proposed method are given.
|ジャーナル||SIAM Journal on Optimization|
|出版ステータス||Published - 2011|
ASJC Scopus subject areas