Iterating Bregman Retractions
Heinz H. Bauschke, Patrick L. Combettes · SIAM Journal on Optimization · 2003
The notion of a Bregman retraction of a closed convex set in Euclidean space is introduced. Bregman retractions include backward Bregman projections and forward Bregman projections, as well as their convex combinations, and are thus quite flexible. The main result on iterating Bregman retractionsunifies several convergence results on projection methods for solving convex feasibility problems. It is also used to construct new sequential and parallel algorithms.