Hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in Banach spaces
Publication:1008525
DOI10.1155/2008/583082zbMath1173.47051OpenAlexW2119759439WikidataQ59219390 ScholiaQ59219390MaRDI QIDQ1008525
Somyot Plubtieng, Kasamsuk Ungchittrakool
Publication date: 30 March 2009
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/55983
Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items (38)
Cites Work
- A strong convergence theorem for relatively nonexpansive mappings in a Banach space
- Limit theorems of operators by convex combinations of nonexpansive retractions in Banach spaces
- Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
- Weak and strong convergence theorems for relatively nonexpansive mappings in Banach spaces
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Block iterative methods for a finite family of relatively nonexpansive mappings in Banach spaces
- Iterative approximation to convex feasibility problems in Banach space
- Strong convergence theorems by hybrid methods for families of nonexpansive mappings in Hilbert spaces
- Strong convergence theorems for a common fixed point of two relatively nonexpansive mappings in a Banach space
- Iterative approaches to convex feasibility problems in Banach spaces
- Strong and weak convergence theorems for equilibrium problems and relatively nonexpansive mappings in Banach spaces
- Existence and Approximation of Fixed Points of Firmly Nonexpansive-Type Mappings in Banach Spaces
- Strong Convergence of a Proximal-Type Algorithm in a Banach Space
- On Projection Algorithms for Solving Convex Feasibility Problems
- Finding projections onto the intersection of convex sets in hilbert spaces
- Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
- On the Maximality of Sums of Nonlinear Monotone Operators
This page was built for publication: Hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in Banach spaces