Hybrid Iterative Methods for Convex Feasibility Problems and Fixed Point Problems of Relatively Nonexpansive Mappings in Banach Spaces

By Somyot Plubtieng, Kasamsuk Ungchittrakool. 2008

57 citations recorded by the source corpus.

The convex feasibility problem (CFP) of finding a point in the nonempty intersection is considered, where is an integer and the 's are assumed to be convex closed subsets of a Banach space . 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.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/0dc14a04e11c4ed2aa9b5971b73436cb91ab8d87