The three-term conjugate gradient (CG) algorithms are among the efficient variants of CG
algorithms for solving optimization models. This is due to their simplicity and low memory …

Following the modification scheme of Dong et al. made on the Hestenes–Stiefel method, we
suggest a modified Polak–Ribiére–Polyak technique which satisfies the sufficient descent …

The area of unconstrained optimization has been enjoying vivid growth recently, with
significant progress on numerical innovative techniques. The classical technique for …

Conjugate gradient methods are interesting iterative methods that solve large scale
unconstrained optimization problems. A lot of recent research has thus focussed on …

In this paper, a modification to the Polak–Ribiére–Polyak (PRP) nonlinear conjugate
gradient method is presented. The proposed method always generates a sufficient descent …

The primarily objective of this paper which is indicated in the field of conjugate gradient
algorithms for unconstrained optimization problems and algorithms is to show the advantage …

Descent condition is a crucial factor to establish the global convergence of nonlinear
conjugate gradient method. In this paper, we propose some modified Yabe–Takano …

A new three-term Hestenes–Stiefel-type conjugate gradient method is proposed in which the
search direction can satisfy the sufficient descent condition as well as an adaptive conjugacy …

In an effort to make modification on the classical Hestenes--Stiefel method, Shengwei et al.
proposed an efficient conjugate gradient method which possesses the sufficient descent …