Block-iterative projection methods for parallel computation of solutions to convex feasibility problems (Q1822907)

The convex feasibility problem is considered. It means that a point in the nonempty intersection of a finite family of closed convex sets in the Euclidean space \(R^ n\) has to be found. The authors derive block- iterative schemes for the problem, which lend themselves to parallel implementation and can be useful in various areas of applications (e.g. image reconstruction from projections, image restoration). The convergence of the algorithms is studied.