A multiprojection algorithm using Bregman projections in a product space (Q1344108): Difference between revisions

Generalized distances give rise to generalized projections into convex sets. An important question is whether or not one can use, within the same projection algorithm, different types of such generalized projections. This question has practical consequences in the area of signal detection and image recovery in situations that can be formulated mathematically as a convex feasibility problem. Using an extension of Pierra's product space formalism, it is shown that a multiprojection algorithm converges. The algorithm is fully simultaneous, i.e., it uses all sets of the convex feasibility problem in each iterative step. Different multiprojection algorithms can be derived from this algorithmic scheme by a judicious choice of the Bregman functions that govern the process. As a by-product of the investigation, the authors obtain block-iterative schemes for certain kinds of linearly constrained optimization problems.