To cite this record: http://ddd.uab.cat/record/151
Approximate iterations in Bregman-function-based proximal algorithms
Eckstein, Jonathan

Date: 1998
Abstract: This paper establishes convergence of generalized Bregman-function-based proximal point algorithms when the iterates are computed only approximately. The problem being solved is modeled as a general maximal monotone operator, and need not reduce to minimization of a function. The accuracy conditions on the iterates resemble those required for the classical "linear" proximal point algorithm, but are slightly stronger; they should be easier to verify or enforce in practice than conditions given in earlier analyses of approximate generalized proximal methods. Subjects to these practically enforceable accuracy restrictions, convergence is obtained under the same conditions currently established for exact Bregman-function-based proximal methods. .
Language: Anglès.
Document: Article ; recerca ; article ; publishedVersion
Subject: Proximal algorithms ; Bregman functions ; Monotone operators
Published in: Mathematical Programming, vol. 83 n. 1 (1998) p. 113-123, ISSN 0025-5610



11 p, 503.4 KB
 UAB restricted access

The record appears in these collections:
Articles > Published articles

 Record created 2006-03-13, last modified 2014-06-14



   Favorit i Compartir
QR image