Some generalized three-term conjugate gradient methods based on CD approach for unconstrained optimization problems

Ladan Arman, Yuanming Xu and Long Liping
Additional contact information
Ladan Arman: School of Aeronautic Science and Engineering, Beihang University, Beijing, China
Yuanming Xu: School of Aeronautic Science and Engineering, Beihang University, Beijing, China
Long Liping: Institute of Mechanics, Chinese Academy of Sciences, Beijing 100190, China

Technium, 2021, vol. 3, issue 2, 67-82

Abstract: Abstract In this paper, based on the efficient Conjugate Descent (CD) method, two generalized CD algorithms are proposed to solve the unconstrained optimization problems. These methods are three-term conjugate gradient methods which the generated directions by using the conjugate gradient parameters and independent of the line search satisfy in the sufficient descent condition. Furthermore, under the strong Wolfe line search, the global convergence of the proposed methods are proved. Also, the preliminary numerical results on the CUTEst collection are presented to show effectiveness of our methods.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
https://techniumscience.com/index.php/technium/article/view/1983 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tec:techni:ojs:1983

DOI: 10.47577/technium.v3i2.1983

Access Statistics for this article

Technium is currently edited by Scurtu Ionut Cristian

More articles in Technium from Technium Science
Bibliographic data for series maintained by Ana Maria Golita ().