Iterative selection methods for common fixed point problems
- 7 February 2006
- journal article
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 324 (2) , 1020-1035
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Solving monotone inclusions via compositions of nonexpansive averaged operatorsOptimization, 2004
- Iterative approaches to finding nearest common fixed points of nonexpansive mappings in Hilbert spacesNonlinear Analysis, 2003
- A block-iterative surrogate constraint splitting method for quadratic signal recoveryIEEE Transactions on Signal Processing, 2003
- Approximating Solutions of Maximal Monotone Operators in Hilbert SpacesJournal of Approximation Theory, 2000
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappingsNumerical Functional Analysis and Optimization, 1998
- The Approximation of Fixed Points of Compositions of Nonexpansive Mappings in Hilbert SpaceJournal of Mathematical Analysis and Applications, 1996
- Approximation of fixed points of nonexpansive mappingsArchiv der Mathematik, 1992
- Convexity, monotonicity, and gradient processes in Hilbert spaceJournal of Mathematical Analysis and Applications, 1976
- On the Mann iterative processTransactions of the American Mathematical Society, 1970
- Fixed points of nonexpanding mapsBulletin of the American Mathematical Society, 1967