Approximate solutions of common fixed-point problems
著者
書誌事項
Approximate solutions of common fixed-point problems
（Springer optimization and its applications, v. 112）
Springer, c2016
大学図書館所蔵 件 / 全5件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 447-451) and 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 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
目次
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.
「Nielsen BookData」 より
