Solving unconstrained optimization problems with some three-term conjugate gradient methods

Main Article Content

Ladan Arman
Yuanming Xu
Mohammad Reza Bayat
Liping Long

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.

Article Details

How to Cite
Arman, L., Xu, Y., Bayat, M. R., & Long, L. (2023). Solving unconstrained optimization problems with some three-term conjugate gradient methods. Tamkang Journal of Mathematics, 54(2), 139–154. https://doi.org/10.5556/j.tkjm.54.2023.4185
Section
Papers