Iterative methods for fixed point problems in Hilbert spaces (Q435248)

As its title suggests, this book is mainly concerned with iterative methods to obtain fixed points. The essential merit of this book in comparison to the two recent related monographs [\textit{C. Chidume}, Lecture Notes in Mathematics 1965, Berlin: Springer (2009; Zbl 1167.47002)] and [\textit{V. Berinde}, Lecture Notes in Mathematics 1912, Berlin: Springer (2007; Zbl 1165.47047)] is that the author has restricted the emphasis on nonexpansive mappings in Hilbert spaces. This is still an extremely large field and at the core of the iterative approximation of fixed points. The book is organized as follows. Chapter 1 provides some background on Hilbert spaces and metric projection, including in its last paragraph a number of topics related to convex optimization problems: convex minimization problems; variational inequality, common fixed point problem; convex feasibility problem; linear feasibility problem; general convex feasibility problem; split feasibility problem; linear split feasibility problem; multiple-sets split feasibility problem. Chapter 2 deals with with several classes of nonexpansive type operators: nonexpansive operators; quasi-nonexpansive operators; strongly quasi-nonexpansive operators; firmly nonexpansive operators; relaxed firmly nonexpansive operators. In Chapter 3, the author studies the convergence of iterative methods (weak convergence and strong convergence), while Chapter 4 is devoted to the study of the so-called algorithmic projection operators, which comprise: examples of metric projections; cutters; alternating projection; simultaneous projection; cyclic projection; Landweber projection; projected Landweber operator; simultaneous cutter; extrapolated simultaneous cutter; extrapolated cyclic cutter. The last chapter of the book, Chapter 5, treats in detail projection methods, considering the following aspects: alternating projection methods; extrapolated alternating projection methods; projected gradient methods; simultaneous projection method; cyclic projection methods; successive projection methods; Landweber method and projected Landweber method; simultaneous cutter methods; sequential cutter methods; extrapolated simultaneous cutter methods; extrapolated cyclic cutter method; surrogate constraints methods; surrogate constraints methods with residual selection. The bibliography contains over 361 references, containing bibliographical references for each topic treated in the book. Another very important merit of the book is the fact that each chapter ends with a paragraph devoted to exercises, which are designed to extend the study and deepen some aspects of the presented material. To conclude, this book is an excellent introduction to various aspects of the iterative approximation of fixed points of nonexpansive operators in Hilbert spaces, with focus on their important applications to convex optimization problems. It would be an excellent text for graduate students, and, by the way the material is structured and presented, it will also serve as a useful introductory text for young researchers in this field.