A new method for nonsmooth convex optimization. Issue 2 (1998) - Wel, Z.
Abstract : A new method for minimizing a proper closed convex functionf is proposed and its convergence properties are studied. The convergence rate depends on both the growth speed offf at minimizers and the choice of proximal parameters. An application of the method extends the corresponding results given by Kort and Bertsekas for proximal minimization algorithms to the case in which the iteration points are calculated approximately. In particular, it relaxes the convergence conditions of Rockafellar's results for the proximal point algorithm.