Algorithms for Solving Common Fixed Point Problems. 1st ed. 2018

種類:

電子ブック

責任表示:

by Alexander J. Zaslavski

出版情報:

Cham : Springer International Publishing : Imprint: Springer, 2018

著者名:

• Zaslavski, Alexander J.
• SpringerLink (Online service)

シリーズ名:

Springer Optimization and Its Applications ; 132

ISBN:

9783319774374 [3319774379]    

注記:

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.
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 of a finite collection of self-mappings in a Hilbert space. A variety of algorithms are considered in this book for solving both types of problems, the study of which has fueled a rapidly growing area of research. This monograph is timely and highlights the numerous applications to engineering, computed tomography, and radiation therapy planning. Totaling eight chapters, this book begins with an introduction to foundational material and moves on to examine iterative methods in metric spaces. The dynamic string-averaging methods for common fixed point problems in normed space are analyzed in Chapter 3. Dynamic string methods, for common fixed point problems in a metric space are introduced and discussed in Chapter

ローカル注記:

学内専用E-BOOKS (local access only)