Hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in Banach spaces (Q1008525): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2119759439 / rank | |||
Normal rank |
Revision as of 21:46, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in Banach spaces |
scientific article |
Statements
Hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in Banach spaces (English)
0 references
30 March 2009
0 references
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.
0 references