Iterating Bregman Retractions
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 13 (4) , 1159-1173
Abstract
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.Keywords
This publication has 22 references indexed in Scilit:
- Block-Iterative Algorithms with Underrelaxed Bregman ProjectionsSIAM Journal on Optimization, 2002
- Proximity Function Minimization Using Multiple Bregman Projections, with Applications to Split Feasibility and Kullback–Leibler Distance MinimizationAnnals of Operations Research, 2001
- Iterative Averaging of Entropic Projections for Solving Stochastic Convex Feasibility ProblemsComputational Optimization and Applications, 1997
- On Projection Algorithms for Solving Convex Feasibility ProblemsSIAM Review, 1996
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimizationOptimization, 1996
- A norm convergence result on random products of relaxed projections in Hilbert spaceTransactions of the American Mathematical Society, 1995
- A multiprojection algorithm using Bregman projections in a product spaceNumerical Algorithms, 1994
- Inconsistent signal feasibility problems: least-squares solutions in a product spaceIEEE Transactions on Signal Processing, 1994
- On the convergence of von Neumann's alternating projection algorithm for two setsSet-Valued Analysis, 1993
- An iterative row-action method for interval convex programmingJournal of Optimization Theory and Applications, 1981