Block-Iterative Algorithms with Underrelaxed Bregman Projections
Yair Censor (yairmath.haifa.ac.il)
Abstract: The notion of relaxation is well understood for orthogonal projections onto convex sets. For general Bregman projections it was considered only for hyperplanes and the question of how to relax Bregman projections onto convex sets that are not linear (i.e., not hyperplanes or half-spaces) has remained open. A definition of underrelaxation of Bregman projections onto general convex sets is given here which includes as special cases the underrelaxed orthogonal projections and the underrelaxed Bregman projections onto linear sets as given by De Pierro and Iusem. With this new definition we construct a block-iterative projection algorithmic scheme and prove its convergence to a solution of the convex feasibility problem. The practical importance of relaxation parameters in the application of such projection algorithms to real-world problems is demonstrated on a problem of image reconstruction from projections.
Keywords: convex feasibility, projection algorithms, Bregman functions, block-iterative algorithms, underrelaxation.
Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )
Category 2: Convex and Nonsmooth Optimization (Convex Optimization )
Citation: SIAM Journal on Optimization, Vol. 13, pp. 283-297, (2002).
Entry Submitted: 03/11/2002
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|