Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization

Abstract

ABSTRACT To solve a large-scale unconstrained optimization problem, in this paper we propose a class of spectral three-term conjugate gradient methods. We indicate that the proposed class, in fact, generates sufficient descent directions and also fulfill Dai–Liao conjugacy condition. We prove the global convergence of the presented class for either uniformly convex or general smooth functions under some suitable conditions, in detail. Finally, in a set of numerical experiments which contains eight conjugate gradient methods and 260 standard problems, we illustrate the efficiency and effectiveness of our class.