<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>03936393</id>
  <dt>j</dt>
  <an>03936393</an>
  <augroup>
    <au>Kiwiel, Krzysztof C.</au>
  </augroup>
  <ti>An algorithm for nonsmooth convex minimization with errors.</ti>
  <so>Math. Comput. 45, 173-180 (1985).</so>
  <py>1985</py>
  <pu>American Mathematical Society, Providence, RI</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>nonsmooth convex minimization</ut>
    <ut>descent methods</ut>
    <ut>aggregate subgradients</ut>
    <ut>iteration</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.2307/2008055</li>
  </ligroup>
  <abgroup>
    <ab>Author's summary: A readily implementable algorithm is given for minimizing any convex, not necessarily differentiable, function f of several variables. At each iteration the method requires only one approximate evaluation of f and its $\epsilon$-subgradient, and finds a search direction by solving a small quadratic programming problem. The algorithm generates a minimizing sequence of points, which converges to a solution whenever f has any minimizers.</ab>
    <rv>I.H.Mufti</rv>
  </abgroup>
</item>