New results related to cutters and to an extrapolated block-iterative method for finding a common fixed point of a collection of them

Given a Hilbert space and a finite family of operators defined on the space, the common fixed point problem (CFPP) is the problem of finding a point in the intersection of the fixed point sets of these operators. A particular case of the problem, when the operators are orthogonal projections, is the convex feasibility problem … Read more

A generalized block-iterative projection method for the common fixed point problem induced by cutters

The block-iterative projections (BIP) method of Aharoni and Censor [Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, Linear Algebra and its Applications 120, (1989), 165-175] is an iterative process for finding asymptotically a point in the nonempty intersection of a family of closed convex subsets. It employs orthogonal projections onto the … Read more