---

＜電子ブック＞
Approximate Solutions of Common Fixed-Point Problems / by Alexander J. Zaslavski
(Springer Optimization and Its Applications. ISSN:19316836 ; 112)

版	1st ed. 2016.
出版者	(Cham : Springer International Publishing : Imprint: Springer)
出版年	2016
本文言語	英語
大きさ	IX, 454 p : online resource
著者標目	*Zaslavski, Alexander J author SpringerLink (Online service)
件　名	LCSH:Mathematical optimization LCSH:Calculus of variations LCSH:Numerical analysis LCSH:Operator theory FREE:Calculus of Variations and Optimization FREE:Numerical Analysis FREE:Operator Theory
一般注記	1.Introduction -- 2. Dynamic string-averaging methods in Hilbert spaces -- 3. Iterative methods in metric spaces -- 4. Dynamic string-averaging methods in normed spaces -- 5. Dynamic string-maximum methods in metric spaces -- 6. Spaces with generalized distances -- 7. Abstract version of CARP algorithm -- 8. Proximal point algorithm -- 9. Dynamic string-averaging proximal point algorithm -- 10. Convex feasibility problems -- 11. Iterative subgradient projection algorithm -- 12. Dynamic string-averaging subgradient projection algorithm.– References.– Index. This book presents results on the convergence behavior of algorithms which are known as vital tools for solving convex feasibility problems and common fixed point problems. The main goal for us in dealing with a known computational error is to find what approximate solution can be obtained and how many iterates one needs to find it. According to know results, these algorithms should converge to a solution. In this exposition, these algorithms are studied, taking into account computational errors which remain consistent in practice. In this case the convergence to a solution does not take place. We show that our algorithms generate a good approximate solution if computational errors are bounded from above by a small positive constant. Beginning with an introduction, this monograph moves on to study: · dynamic string-averaging methods for common fixed point problems in a Hilbert space · dynamic string methods for common fixed point problems in a metricspace · dynamic string-averaging version of the proximal algorithm · common fixed point problems in metric spaces · common fixed point problems in the spaces with distances of the Bregman type · a proximal algorithm for finding a common zero of a family of maximal monotone operators · subgradient projections algorithms for convex feasibility problems in Hilbert spaces HTTP:URL=https://doi.org/10.1007/978-3-319-33255-0

 類似資料