Hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in Banach spaces (Q1008525): Difference between revisions

The convex feasibility problem (CFP) of finding a point in the nonempty intersection \(\cap^N_{i=1}C_i\) is considered, where \(N\geq 1\) is an integer and the \(C_i\)'s are assumed to be convex closed subsets of a Banach space \(E\). By using hybrid iterative methods, the authors prove theorems on the strong convergence to a common fixed point for a finite family of relatively nonexpansive mappings. Then, they apply their results for solving convex feasibility problems in Banach spaces.