Algorithms for Solving Common Fixed Point Problems

• Main Author: Zaslavski, Alexander J. (Author, http://id.loc.gov/vocabulary/relators/aut)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic eBook
• Language: English
• Published: Cham : Springer International Publishing : Imprint: Springer, 2018.
• Edition: 1st ed. 2018.
• Series: Springer Optimization and Its Applications, 132
• Subjects: Calculus of variations.; Operator theory.; Numerical analysis.; Calculus of Variations and Optimal Control; Optimization.; Operator Theory.; Numerical Analysis.

This book details approximate solutions to common fixed point problems and convex feasibility problems in the presence of perturbations. Convex feasibility problems search for a common point of a finite collection of subsets in a Hilbert space; common fixed point problems pursue a common fixed point...

Table of Contents:

• 1. Introduction
• 2. Iterative methods in metric spaces
• 3. Dynamic string-averaging methods in normed spaces
• 4. Dynamic string-maximum methods in metric spaces
• 5. Abstract version of CARP algorithm
• 6. Proximal point algorithm
• 7. Dynamic string-averaging proximal point algorithm
• 8. Convex feasibility problems.