The goal is to show the convergence of algorithms, which are known as important tools for solving convex feasibility problems and common fixed point problems.The text also presents studies of algorithms based on unions of nonexpansive maps, inconsistent convex feasibility problems, and split common fixed point problems.
Alexander J. Zaslavski, Department of Mathematics, Technion – Israel Institute of Technology, Haifa, Israel.