Abstract

In this paper, for finding a common zero of a finite family of m-accretive mappings in uniformly convex Banach spaces with a uniformly Gâteaux differentiable norm, we propose an implicit iteration algorithm and an explicit one, based on a convex combination of the steepest-descent method and a composition of resolvents. We also show that our main algorithm contains some iterative ones in literature as special cases. Finally, we give numerical examples for illustration.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call