This book is on conjugate gradient methods for unconstrained optimization. The concept of
conjugacy was introduced by Magnus Hestenes and Garrett Birkhoff in 1936 in the context of …

Abstract period.. The paper presents some open problems associated to the nonlin hyphen
ear conjugate gradient algorithms for unconstrained optimization period Mainly comma …

In this paper, we propose a family of spectral conjugate gradient methods for solving
unconstrained optimization problems. Specifically, we provide two classes of bounded …

Recently, Zhang [13] take a little modification to the Wei–Yao–Liu nonlinear conjugate
gradient method proposed by Wei et al.[10] such that the modified method (called NPRP …

Abstract The Conjugate Gradient (CG) method of unconstrained optimization algorithms
possesses good properties like less requirement memory and global convergence …

Conjugate gradient method is one of the most effective methods for solving large-scale
optimization problems. Based on the CD conjugate parameter and an improved PRP …

This paper establishes a spectral conjugate gradient method for solving unconstrained
optimization problems, where the conjugate parameter and the spectral parameter satisfy a …

The Dai and Yuan conjugate gradient (CG) method is one of the classical CG algorithms
using the numerator‖ gk+ 1‖ 2. When the usual Wolfe line search is used, the algorithm is …

A numerical evaluation and comparisons using performance profiles of some representative
conjugate gradient algorithms for solving a large variety of large-scale unconstrained …

The spectral conjugate gradient methods, with simple construction and nice numerical
performance, are a kind of effective methods for solving large-scale unconstrained …