The book is devoted to the study of approximate solutions of fixed point problems in the presence of computational errors. It begins with a study of approximate solutions of star-shaped feasibility problems in the presence of perturbations. 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. A number of algorithms are considered for solving convex feasibility problems and common fixed point problems. The book will be of interest for researchers and engineers working in optimization, numerical analysis, and fixed point theory. It also can be useful in preparation courses for graduate students. The main feature of the book which appeals specifically to this audience is the study of the influence of computational errors for several important algorithms used for nonconvex feasibility problems.

Autorentext

Alexander J. Zaslavski, Department of Mathematics, Technion - Israel Institute of Technology, Haifa, Israel.