A modified three-term PRP conjugate gradient algorithm for optimization models
Abstract The nonlinear conjugate gradient (CG) algorithm is a very effective method for optimization, especially for large-scale problems, because of its low memory requirement and simplicity. Zhang et al. (IMA J. Numer. Anal. 26:629-649, 2006) firstly propose a three-term CG algorithm based on the...
Main Author: | Yanlin Wu |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2017-05-01
|
Series: | Journal of Inequalities and Applications |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13660-017-1373-4 |
Similar Items
-
A modified three terms PRP conjugate gradient method
by: Songhua WANG, et al.
Published: (2018-12-01) -
A modified three-term HS conjugate gradient method for solving nonsmooth minimizations
by: Yong LI, et al.
Published: (2018-04-01) -
A new class of three-term conjugate Gradient methods for solving unconstrained minimization problems
by: Alaa Luqman Ibrahim, et al.
Published: (2019-12-01) -
A New Formula for Conjugate Gradient in Unconstrained Optimization
by: Hussein Wali, et al.
Published: (2020-05-01) -
A New Three–Term Conjugate Gradient Method with Descent Direction for Unconstrained Optimization
by: XiaoLiang Dong, et al.
Published: (2016-05-01)