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...
Main Authors: | Moyi, Aliyu Usman, Leong, Wah June |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis
2016
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/53933/1/Sufficient%20descent%20three%20term%20conjugate%20gradient%20method%20.pdf |
Similar Items
-
A Modified Sufficient Descent Polak–Ribiére–Polyak Type Conjugate Gradient Method for Unconstrained Optimization Problems
by: Xiuyun Zheng, et al.
Published: (2018-09-01) -
A New Formula for Conjugate Gradient in Unconstrained Optimization
by: Hussein Wali, et al.
Published: (2020-05-01) -
Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
by: Masoud Fatemi, et al.
Published: (2016-04-01) -
A modified three terms PRP conjugate gradient method
by: Songhua WANG, et al.
Published: (2018-12-01) -
A New Conjugate Gradient Coefficient for Unconstrained Optimization Based On Dai-Liao
by: Alaa L. Ibrahim, et al.
Published: (2019-03-01)