Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization
In this paper, we propose a three-term conjugate gradient method via the symmetric rank-one update. The basic idea is to exploit the good properties of the SR1 update in providing quality Hessian approximations to construct a conjugate gradient line search direction without the storage of matrices a...
Saved in:
Main Authors: | Moyi, Aliyu Usman, Leong, Wah June |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis
2016
|
Online Access: | http://psasir.upm.edu.my/id/eprint/53933/1/Sufficient%20descent%20three%20term%20conjugate%20gradient%20method%20.pdf http://psasir.upm.edu.my/id/eprint/53933/ http://www.tandfonline.com/doi/abs/10.1080/02331934.2014.994625?journalCode=gopt20 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
by: Ling, Mei Mei
Published: (2015) -
The sufficient descent condition of nonlinear conjugate gradient method
by: Basri, Sri Mazzura, et al.
Published: (2018) -
A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
by: Moyi, Aliyu Usman, et al.
Published: (2016) -
Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
by: Hong, Seng Sim, et al.
Published: (2021) -
The proof of sufficient descent condition for a new type of conjugate gradient methods
by: Mustafa, Mamat, et al.
Published: (2014)