Solving Common Fixed Point Problems with a Countable Family of Operators
摘要
In this paper we study common fixed point problems. The first one is a general common fixed point problem in a metric space with a countable family of operators, while the second problem is a convex feasibility problem with infinitely many constraints solved by the subgradient projection algorithm. We show that our algorithms converge to a solution.