Convergence comparison of several iteration algorithms for the common fixed point problems

20Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We discuss the following viscosity approximations with the weak contraction A for a nonexpansive mapping sequence {Tn}, yn = anAyn + (1 - an) Tnyn, xn+1 = anAxn + (1 - an) Tnxn. We prove that Browder's and Halpern's type convergence theorems imply Moudafi's viscosity approximations with the weak contraction, and give the estimate of convergence rate between Halpern's type iteration and Mouda's viscosity approximations with the weak contraction.

Cite

CITATION STYLE

APA

Song, Y., & Liu, X. (2009). Convergence comparison of several iteration algorithms for the common fixed point problems. Fixed Point Theory and Applications, 2009. https://doi.org/10.1155/2009/824374

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free