A general iterative method for approximation of fixed points and their applications
Abstract
We propose a new iterative algorithm and prove strong and weak convergence theorems for computing fixed points of nonexpansive mappings in a Banach space. We showed that our iteration process is faster than Picard, Mann and S iteration processes. Our results are applied for finding solutions of variational inequality problem.
Copyright © 2013 Ibrahim Karahan, Murat Ozdemir. 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.
Cite this article
I. Karahan, M. Ozdemir, A general iterative method for approximation of fixed points and their applications, Adv. Fixed Point Theory 3 (2013), 510–526.
BibTeX
@article{Karahan2013,
author = {Karahan, Ibrahim and Ozdemir, Murat},
title = {A general iterative method for approximation of fixed points and their applications},
journal = {Adv. Fixed Point Theory},
volume = {3},
year = {2013},
pages = {510--526},
doi = {}
}