A Modified Three-Term Type CD Conjugate Gradient Algorithm for Unconstrained Optimization Problems

Conjugate gradient methods are well-known methods which are widely applied in many practical fields. CD conjugate gradient method is one of the classical types. In this paper, a modified three-term type CD conjugate gradient algorithm is proposed. Some good features are presented as follows: (i) A m...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical problems in engineering 2020, Vol.2020 (2020), p.1-14
Main Authors: Pham, Hongtruong, Li, Xiangrong, Li, Pengyuan, Wang, Zhan
Format: Article
Language:English
Subjects:
Algorithms
Conjugate gradient method
Conjugates
Experiments
Mathematical problems
Optimization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Conjugate gradient methods are well-known methods which are widely applied in many practical fields. CD conjugate gradient method is one of the classical types. In this paper, a modified three-term type CD conjugate gradient algorithm is proposed. Some good features are presented as follows: (i) A modified three-term type CD conjugate gradient formula is presented. (ii) The given algorithm possesses sufficient descent property and trust region property. (iii) The algorithm has global convergence with the modified weak Wolfe–Powell (MWWP) line search technique and projection technique for general function. The new algorithm has made great progress in numerical experiments. It shows that the modified three-term type CD conjugate gradient method is more competitive than the classical CD conjugate gradient method.
ISSN:1024-123X
1563-5147
DOI:10.1155/2020/4381515