<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>01611573</id>
  <dt>j</dt>
  <an>01611573</an>
  <augroup>
    <au>Shi, Zhenjun</au>
  </augroup>
  <ti>A supermemory gradient method for unconstrained optimization.</ti>
  <so>J. Eng. Math., Xi'an 17, No.2, 99-104 (2000).</so>
  <py>2000</py>
  <pu>Department of Applied Mathematics, Xi'an Jiaotong University, Xi'an</pu>
  <lagroup>
    <la>ZH</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: A supermemory gradient method for unconstrained optimization problem is presented. The convergence of this algorithm is analyzed. Numerical experiments show that the algorithm is efficient by comparing with FR, PR conjugate gradient method and steepest descent method with Armijo line searches.</ab>
    <rv></rv>
  </abgroup>
</item>