Solutions of Fixed Point Problems with Computational Errors

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 errorsfor several important algorithms used for nonconvex feasibility problems.


1144393281
Solutions of Fixed Point Problems with Computational Errors

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 errorsfor several important algorithms used for nonconvex feasibility problems.


159.0 In Stock
Solutions of Fixed Point Problems with Computational Errors

Solutions of Fixed Point Problems with Computational Errors

by Alexander J. Zaslavski
Solutions of Fixed Point Problems with Computational Errors

Solutions of Fixed Point Problems with Computational Errors

by Alexander J. Zaslavski

eBook2024 (2024)

$159.00 

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers


Overview

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 errorsfor several important algorithms used for nonconvex feasibility problems.



Product Details

ISBN-13: 9783031508790
Publisher: Springer-Verlag New York, LLC
Publication date: 03/19/2024
Series: Springer Optimization and Its Applications , #210
Sold by: Barnes & Noble
Format: eBook
File size: 33 MB
Note: This product may take a few minutes to download.

About the Author

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

Table of Contents

1 - Introduction.- 2 - Iterative methods in a Hilbert space.- 3 - The Cimmino algorithm in a Hilbert space.- 4 - Dynamic string-averaging methods in Hilbert spaces.- 5 - Methods with remotest set control in a Hilbert space.- 6 - Algorithms based on unions of nonexpansive maps.- 7 - Inconsistent convex feasibility problems.- 8 - Split common fixed point problems.

From the B&N Reads Blog

Customer Reviews