A New Hybrid Three-Term Conjugate Gradient Algorithm for Large-Scale Unconstrained Problems
Three-term conjugate gradient methods have attracted much attention for large-scale unconstrained problems in recent years, since they have attractive practical factors such as simple computation, low memory requirement, better descent property and strong global convergence property. In this paper,...
Main Authors: | Qi Tian, Xiaoliang Wang, Liping Pang, Mingkun Zhang, Fanyun Meng |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-06-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/12/1353 |
Similar Items
-
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 Three–Term Conjugate Gradient Method with Descent Direction for Unconstrained Optimization
by: XiaoLiang Dong, et al.
Published: (2016-05-01) -
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) -
A New conjugate gradient method for unconstrained optimization problems with descent property
by: Hussein Ageel Khatab, et al.
Published: (2020-12-01)