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

The convex feasibility problem (CFP) of finding a point in the nonempty intersection ⋂i=1NCi is considered, where N⩾1 is an integer and the Ci's are assumed to be convex closed subsets of a Banach space E. By using hybrid iterative methods, we prove theorems on the st...

Full description

Bibliographic Details
Format: Article
Language:English
Published: SpringerOpen 2009-03-01
Series:Fixed Point Theory and Applications
Online Access:http://dx.doi.org/10.1155/2008/583082
_version_ 1818384346995752960
collection DOAJ
description The convex feasibility problem (CFP) of finding a point in the nonempty intersection ⋂i=1NCi is considered, where N⩾1 is an integer and the Ci's are assumed to be convex closed subsets of a Banach space E. 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.
first_indexed 2024-12-14T03:20:49Z
format Article
id doaj.art-798315d7fcde45569651c18d653d5dce
institution Directory Open Access Journal
issn 1687-1820
1687-1812
language English
last_indexed 2024-12-14T03:20:49Z
publishDate 2009-03-01
publisher SpringerOpen
record_format Article
series Fixed Point Theory and Applications
spelling doaj.art-798315d7fcde45569651c18d653d5dce2022-12-21T23:19:02ZengSpringerOpenFixed Point Theory and Applications1687-18201687-18122009-03-01200810.1155/2008/583082Hybrid Iterative Methods for Convex Feasibility Problems and Fixed Point Problems of Relatively Nonexpansive Mappings in Banach SpacesThe convex feasibility problem (CFP) of finding a point in the nonempty intersection ⋂i=1NCi is considered, where N⩾1 is an integer and the Ci's are assumed to be convex closed subsets of a Banach space E. 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.http://dx.doi.org/10.1155/2008/583082
spellingShingle Hybrid Iterative Methods for Convex Feasibility Problems and Fixed Point Problems of Relatively Nonexpansive Mappings in Banach Spaces
Fixed Point Theory and Applications
title Hybrid Iterative Methods for Convex Feasibility Problems and Fixed Point Problems of Relatively Nonexpansive Mappings in Banach Spaces
title_full Hybrid Iterative Methods for Convex Feasibility Problems and Fixed Point Problems of Relatively Nonexpansive Mappings in Banach Spaces
title_fullStr Hybrid Iterative Methods for Convex Feasibility Problems and Fixed Point Problems of Relatively Nonexpansive Mappings in Banach Spaces
title_full_unstemmed Hybrid Iterative Methods for Convex Feasibility Problems and Fixed Point Problems of Relatively Nonexpansive Mappings in Banach Spaces
title_short Hybrid Iterative Methods for Convex Feasibility Problems and Fixed Point Problems of Relatively Nonexpansive Mappings in Banach Spaces
title_sort hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in banach spaces
url http://dx.doi.org/10.1155/2008/583082