On some Mann’s type iterative algorithms

First we present some interesting variants of Mann’s method. In the last section, we show that many existing results in the literature are concrete realizations of our general scheme under varying assumptions on the coefficients.

Saved in:
Bibliographic Details
Published inFixed point theory and applications (Hindawi Publishing Corporation) Vol. 2015; no. 1; pp. 1 - 16
Main Authors Hussain, Nawab, Marino, Giuseppe, Muglia, Luigi, Alamri, Badriah AS
Format Journal Article
LanguageEnglish
Published Cham Springer International Publishing 03.02.2015
Subjects
Analysis
Applications of Mathematics
Concretes
Differential Geometry
Iterative algorithms
Mathematical and Computational Biology
Mathematics
Mathematics and Statistics
Topology
58E35
two-step algorithms
47H10
47H09
hierarchical fixed point problems
65J25
variational inequalities
nonexpansive mappings
Online AccessGet full text

Cover

More Information
Summary:First we present some interesting variants of Mann’s method. In the last section, we show that many existing results in the literature are concrete realizations of our general scheme under varying assumptions on the coefficients.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1687-1812
1687-1812
DOI:10.1186/s13663-015-0267-8