Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4624180 | Journal of Mathematical Analysis and Applications | 2006 | 13 Pages |
Abstract
Let X be a Banach space and A an m-accretive operator with a zero. Consider the iterative method that generates the sequence {xn} by the algorithm xn+1=αnu+(1−αn)Jrnxn, where {αn} and {rn} are two sequences satisfying certain conditions, and Jr denotes the resolvent −1(I+rA) for r>0. Strong convergence of the algorithm {xn} is proved assuming X either has a weakly continuous duality map or is uniformly smooth.
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis