Copyright © 2012 Haiqing Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
Let be a uniformly convex Banach space and be a nonexpansive semigroup such that . Consider the iterative method that generates the sequence by the algorithm , where , , and are three sequences satisfying certain conditions, is a contraction mapping. Strong convergence of the algorithm is proved assuming either has a weakly continuous duality map or has a uniformly Gâteaux differentiable norm.