A Robust Spectral Three-Term Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems
In this paper, we investigated a new improved Conjugate Gradient (CG) algorithm of a Three-Term type (TTCG) based on Dai and Liao procedure to improve the CG algorithm of (Hamoda, Rivaie, and Mamat / HRM). The new CG-algorithm satisfies both the conjugacy condition and the sufficient descent condi...
Main Authors: | Abbas Al-Bayati, Sabreen Abbas |
---|---|
Format: | Article |
Language: | Arabic |
Published: |
Mosul University
2019-06-01
|
Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
Subjects: | |
Online Access: | https://csmj.mosuljournals.com/article_163504_733a8edeace9c77541e54370151f62be.pdf |
Similar Items
-
New Scale Dai-Yaun Conjugate Gradient Method for Unconstrained Optimization
by: Hamsa Chilmerane
Published: (2013-12-01) -
Least-squares-based three-term conjugate gradient methods
by: Chunming Tang, et al.
Published: (2020-02-01) -
An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property
by: Zabidin Salleh, et al.
Published: (2016-04-01) -
Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property
by: Zabidin Salleh, et al.
Published: (2022-01-01) -
A modified quadratic hybridization of Polak-Ribiere-Polyak and Fletcher-Reeves conjugate gradient method for unconstrained optimization problems
by: Pro Kaelo, et al.
Published: (2017-07-01)