TY - BOOK ID - 7908853 TI - Approximate solutions of common fixed-point problems PY - 2016 SN - 3319332538 3319332554 PB - Cham : Springer International Publishing : Imprint: Springer, DB - UniCat KW - Mathematics. KW - Operator theory. KW - Numerical analysis. KW - Calculus of variations. KW - Calculus of Variations and Optimal Control; Optimization. KW - Numerical Analysis. KW - Operator Theory. KW - Fixed point theory. KW - Fixed point theorems (Topology) KW - Nonlinear operators KW - Coincidence theory (Mathematics) KW - Mathematical optimization. KW - Mathematical analysis KW - Optimization (Mathematics) KW - Optimization techniques KW - Optimization theory KW - Systems optimization KW - Maxima and minima KW - Operations research KW - Simulation methods KW - System analysis KW - Functional analysis KW - Isoperimetrical problems KW - Variations, Calculus of UR - https://www.unicat.be/uniCat?func=search&query=sysid:7908853 AB - 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 . ER -