Approximate Solutions of Common Fixed-Point Problems. 1st ed. 2016

種類:

電子ブック

責任表示:

by Alexander J. Zaslavski

出版情報:

Cham : Springer International Publishing : Imprint: Springer, 2016

著者名:

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

シリーズ名:

Springer Optimization and Its Applications ; 112

ISBN:

9783319332550 [3319332554]    

注記:

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 metric space · dynamic string-averaging version of the proximal al

ローカル注記:

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