×

Implicit iteration scheme with perturbed mapping for common fixed points of a finite family of nonexpansive mappings. (English) Zbl 1105.47061

In this paper, a new implicit iteration scheme with perturbed mapping for the approximation of common fixed points of a finite family of nonexpansive mappings is given. Some convergence theorems and necessary and sufficient conditions for strong convergence of this implicit iteration scheme are obtained.

MSC:

47J25 Iterative procedures involving nonlinear operators
47H09 Contraction-type mappings, nonexpansive mappings, \(A\)-proper mappings, etc.
47H10 Fixed-point theorems
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Geobel, K.; Kirk, W. A., Topics on Metric Fixed-Point Theory (1990), Cambridge University Press: Cambridge University Press Cambridge, England · Zbl 0708.47031
[2] Opial, Z., Weak convergence of the sequence of successive approximations for nonexpansive mappings, Bull. Am. Math. Soc., 73, 591-597 (1967) · Zbl 0179.19902
[3] Osilike, M. O.; Aniagbosor, S. C.; Akuchu, B. G., Fixed points of asymptotically demicontractive mappings in arbitrary Banach spaces, PanAm. Math. J., 12, 77-88 (2002) · Zbl 1018.47047
[4] Tan, K. K.; Xu, H. K., Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process, J. Math. Anal. Appl., 178, 301-308 (1993) · Zbl 0895.47048
[5] Xu, H. K.; Kim, T. H., Convergence of hybrid steepest-descent methods for variational inequalities, J. Optim. Theory Appl., 119, 1, 185-201 (2003) · Zbl 1045.49018
[6] Xu, H. K.; Ori, R. G., An implicit iteration process for nonexpansive mappings, Numer. Funct. Anal. Optim., 22, 767-773 (2001) · Zbl 0999.47043
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.