Hybrid Iterative Methods for Convex Feasibility Problems and Fixed Point Problems of Relatively Nonexpansive Mappings in Banach Spaces
Somyot Plubtieng, Kasamsuk Ungchittrakool · Fixed Point Theory and Applications · 2009
Abstract The convex feasibility problem (CFP) of finding a point in the nonempty intersection "Equation missing" is considered, where "Equation missing" is an integer and the "Equation missing"'s are assumed to be convex closed subsets of a Banach space "Equation missing". By using hybrid iterative methods, we prove theorems on the strong convergence to a common fixed point for a finite family of relatively nonexpansive mappings. Then, we apply our results for solving convex feasibility problems in Banach spaces.