Titlebook: Algorithms for Solving Common Fixed Point Problems; Alexander J. Zaslavski Book 2018 Springer International Publishing AG, part of Springe

管理员

Proximal Point Algorithm,nder the presence of perturbations. We show that the inexact proximal point method generates an approximate solution if perturbations are summable. We also show that if the perturbations are sufficiently small, then the inexact proximal point method produces approximate solutions.

蛤肉

conifer

Abjure

Dynamic String-Maximum Methods in Metric Spaces,In this chapter we study the convergence of dynamic string-maximum methods for solving common fixed point problems in a metric space. Our main goal is to obtain an approximate solution of the problem using perturbed algorithms. We show that the inexact iterative method generates an approximate solution if perturbations are summable.

hermitage

follicular-unit

https://doi.org/10.1007/978-3-319-77437-4fixed point problems; Hilbert space; convex feasibility problems; tomography; Dynamic string methods

sleep-spindles

978-3-030-08455-4Springer International Publishing AG, part of Springer Nature 2018

poliosis

蘑菇

https://doi.org/10.1007/978-3-322-84133-9 approximate solution of the problem using perturbed algorithms. We show that the inexact iterative method generates an approximate solution if perturbations are summable. We also show that if the mappings are nonexpansive and the perturbations are sufficiently small, then the inexact method produce

HERE

https://doi.org/10.1007/978-3-322-84133-9is to obtain an approximate solution of the problem using perturbed algorithms. We show that the inexact dynamic string-averaging algorithm generates an approximate solution if perturbations are summable. We also show that if the mappings are nonexpansive and the perturbations are sufficiently small