Algorithms for Solving Common Fixed Point Problems

Nonfiction, Science & Nature, Mathematics, Functional Analysis, Calculus
Cover of the book Algorithms for Solving Common Fixed Point Problems by Alexander J. Zaslavski, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Alexander J. Zaslavski ISBN: 9783319774374
Publisher: Springer International Publishing Publication: May 2, 2018
Imprint: Springer Language: English
Author: Alexander J. Zaslavski
ISBN: 9783319774374
Publisher: Springer International Publishing
Publication: May 2, 2018
Imprint: Springer
Language: English

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 4. Chapter 5 is devoted to the convergence of an abstract version of the algorithm which has been called  component-averaged row projections (CARP). Chapter 6 studies a proximal algorithm for finding a common zero of a family of maximal monotone operators. Chapter 7 extends the results of Chapter 6 for a dynamic string-averaging version of the proximal algorithm. In Chapters 8 subgradient projections algorithms for convex feasibility problems are examined for infinite dimensional Hilbert spaces. 

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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 4. Chapter 5 is devoted to the convergence of an abstract version of the algorithm which has been called  component-averaged row projections (CARP). Chapter 6 studies a proximal algorithm for finding a common zero of a family of maximal monotone operators. Chapter 7 extends the results of Chapter 6 for a dynamic string-averaging version of the proximal algorithm. In Chapters 8 subgradient projections algorithms for convex feasibility problems are examined for infinite dimensional Hilbert spaces. 

More books from Springer International Publishing

Cover of the book Conveyor Belt Furnace Thermal Processing by Alexander J. Zaslavski
Cover of the book Computational Methods and Clinical Applications for Spine Imaging by Alexander J. Zaslavski
Cover of the book Innovative Research Methodologies in Management by Alexander J. Zaslavski
Cover of the book High-Voltage Test and Measuring Techniques by Alexander J. Zaslavski
Cover of the book Human-Computer Interaction. Recognition and Interaction Technologies by Alexander J. Zaslavski
Cover of the book Concentration Inequalities for Sums and Martingales by Alexander J. Zaslavski
Cover of the book Information Management and Big Data by Alexander J. Zaslavski
Cover of the book Colitis by Alexander J. Zaslavski
Cover of the book Reversibility and Universality by Alexander J. Zaslavski
Cover of the book Information Security and Cryptology by Alexander J. Zaslavski
Cover of the book Physically Unclonable Functions by Alexander J. Zaslavski
Cover of the book Geographic Information Science at the Heart of Europe by Alexander J. Zaslavski
Cover of the book Dynamic Data-Driven Environmental Systems Science by Alexander J. Zaslavski
Cover of the book Ethics for Social Impact by Alexander J. Zaslavski
Cover of the book From Biomolecules to Chemofossils by Alexander J. Zaslavski
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy