<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06031709</id>
  <dt>j</dt>
  <an>06031709</an>
  <augroup>
    <au>Zhang, Yang</au>
    <au>Wang, Kairong</au>
  </augroup>
  <ti>A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties.</ti>
  <so>Numer. Algorithms 60, No. 1, 135-152 (2012).</so>
  <py>2012</py>
  <pu>Springer, Dordrecht</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>conjugate gradient method</ut>
    <ut>line search</ut>
    <ut>sufficient descent condition</ut>
    <ut>global convergence</ut>
    <ut>Polak-Ribi\`ere-Polyak</ut>
    <ut>Hestenes-Stiefel</ut>
    <ut>Liu-Storey</ut>
    <ut>Dai-Yuan-type</ut>
    <ut>conjugate-descent-type</ut>
    <ut>numerical results</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/s11075-011-9515-0</li>
  </ligroup>
  <abgroup>
    <ab>The authors present a new general form of conjugate gradient methods and give a sufficient condition for the global convergence of the proposed method under weak conditions on the objective function. They also establish a variety of convergence results on other conjugate gradient methods, which include the Polak-Ribi\`ere-Polyak, Hestenes-Stiefel, Liu-Storey, Dai-Yuan-type and Conjugate-Descent-type methods. Some preliminary numerical results are provided.</ab>
    <rv>Guoqiang Wang (Shanghai)</rv>
  </abgroup>
</item>