Divergence function, duality, and convex analysis
Neural Computation
Efficient controls for finitely convergent sequential algorithms
ACM Transactions on Mathematical Software (TOMS)
| Hi-index | 0.00 |
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 retractions unifies several convergence results on projection methods for solving convex feasibility problems. It is also used to construct new sequential and parallel algorithms.