Abstract
The Mann iterates behave well for nonexpansive mappings for any initial guess in the domain. Our aim in this article is to extend this method to a broad class of inexact fixed point algorithms generated by nearly nonexpansive sequences in Banach spaces and to locate the weak limit of the iterates by its initial guesses. Due to the inexactness, our algorithms become efficiently applicable for a wider class of problems. As applications, we give convergence theorems for finding solutions of variational inclusion problems and constrained multiple-sets split feasibility problems. Our results are significant refinements and improvements of the corresponding results in the literature.
| Original language | English |
|---|---|
| Pages (from-to) | 1312-1338 |
| Number of pages | 27 |
| Journal | Numerical Functional Analysis and Optimization |
| Volume | 37 |
| Issue number | 10 |
| DOIs | |
| State | Published - 2 Oct 2016 |
Bibliographical note
Publisher Copyright:© 2016, Copyright © Taylor & Francis Group, LLC.
Keywords
- Accretive operator
- Mann iteration method
- nearly Lipschitzian mapping
- nonexpansive mapping
- resolvent operator
- split feasibility problem
ASJC Scopus subject areas
- Analysis
- Signal Processing
- Computer Science Applications
- Control and Optimization
Fingerprint
Dive into the research topics of 'Convergence of Inexact Mann Iterations Generated by Nearly Nonexpansive Sequences and Applications'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver