4 papers
New results related to cutters and to an extrapolated block-iterative method for finding a common fixed point of a collection of them
Yair Censor, Daniel Reem, Maroun Zaknoon
Given a Hilbert space and a finite family of operators defined on the space, the common fixed point problem (CFPP) is to find a point in the intersection of the fixed point sets of…
A Generalized Block-Iterative Projection Method for the Common Fixed Point Problem Induced by Cutters
Yair Censor, Daniel Reem, Maroun Zaknoon
The block-iterative projections (BIP) method of Aharoni and Censor [Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, Linear…
Data-compatibility of algorithms
Yair Censor, Maroun Zaknoon, Alexander J. Zaslavski
The data-compatibility approach to constrained optimization, proposed here, strives to a point that is "close enough" to the solution set and whose target function value is "close…
Algorithms and Convergence Results of Projection Methods for Inconsistent Feasibility Problems: A Review
Yair Censor, Maroun Zaknoon
The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsist…