LEADER 03282nam  22005655  450 
001 9910845095903321
005 20240319000631.0
010   $a3-031-50879-3
024 7 $a10.1007/978-3-031-50879-0
035   $a(CKB)30977750600041
035   $a(MiAaPQ)EBC31222021
035   $a(Au-PeEL)EBL31222021
035   $a(DE-He213)978-3-031-50879-0
035   $a(EXLCZ)9930977750600041
100   $a20240319d2024      u|         0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aSolutions of Fixed Point Problems with Computational Errors$b[electronic resource] /$fby Alexander J. Zaslavski
205   $a1st ed. 2024.
210  1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024.
215   $a1 online resource (392 pages)
225 1 $aSpringer Optimization and Its Applications,$x1931-6836 ;$v210
311   $a3-031-50878-5 
327   $a1 - 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.
330   $aThe 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 errors for several important algorithms used for nonconvex feasibility problems.
410  0$aSpringer Optimization and Its Applications,$x1931-6836 ;$v210
606   $aMathematical optimization
606   $aOperator theory
606   $aMathematics$xData processing
606   $aOptimization
606   $aOperator Theory
606   $aComputational Mathematics and Numerical Analysis
615  0$aMathematical optimization.
615  0$aOperator theory.
615  0$aMathematics$xData processing.
615 14$aOptimization.
615 24$aOperator Theory.
615 24$aComputational Mathematics and Numerical Analysis.
676   $a519.6
700   $aZaslavski$b Alexander J$0721713
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910845095903321
996   $aSolutions of Fixed Point Problems with Computational Errors$94149358
997   $aUNINA