DocServer

Iterating Bregman Retractions

Bauschke, Heinz H. and Combettes, Patrick L. (2002) Iterating Bregman Retractions. [Preprint]

[img]
Preview
Postscript
Download (277Kb) | Preview
    [img]
    Preview
    PDF
    Download (342Kb) | Preview

      Abstract

      The notion of a Bregman retraction of a closed convex set in Euclidean space is introduced. Bregman retractions include Bregman projections, forward projections, as well as their convex combinations, and are thus quite flexible. The main result on iterating Bregman retractions unifies several convergence results on projection methods for solving convex feasibility problems, and it is also used to construct new sequential and parallel algorithms.

      Item Type: Preprint
      Additional Information: pubdom FALSE
      Uncontrolled Keywords: backward projection, Bregman distance, Bregman function, Bregman projection, Bregman retraction, convex feasibility problem, forward projection, Legendre function, paracontraction, projection algorithm
      Subjects: UNSPECIFIED
      Faculty: UNSPECIFIED
      Depositing User: Users 1 not found.
      Date Deposited: 20 Nov 2003
      Last Modified: 21 Apr 2010 11:13
      URI: https://docserver.carma.newcastle.edu.au/id/eprint/129

      Actions (login required)

      View Item