@article {IOPORT.01910544,
    author       = {Dai, Yu-Hong},
    title        = {A family of hybrid conjugate gradient methods for unconstrained optimization.},
    year         = {2003},
    journal      = {Mathematics of Computation},
    volume       = {72},
    number       = {243},
    issn         = {0025-5718},
    pages        = {1317-1328},
    publisher    = {American Mathematical Society, Providence, RI},
    doi          = {10.1090/S0025-5718-03-01491-1},
    abstract     = {Summary: Conjugate gradient methods are an important class of methods for unconstrained optimization, especially for large-scale problems. Recently, they have been much studied. This paper proposes a three-parameter family of hybrid conjugate gradient methods. Two important features of the family are that (i) it can avoid the propensity of small steps, namely, if a small step is generated away from the solution point, the next search direction will be close to the negative gradient direction; and (ii) its descent property and global convergence are likely to be achieved provided that the line search satisfies the Wolfe conditions. Some numerical results with the family are also presented.},
    identifier   = {01910544},
}