and the fixed point set of nonlinear mappings (for instance, nonexpansive mapping, strictly pseudocontractive mapping, Lipschitzian pseudocontractive mapping, etc).; see, for instance, [41 43] and the references therein.
Many researchers have studied and applied this mapping for finding a common fixed point of nonexpansive mappings, for instance, see [8 23].
Future study should explore other mappings: for instance variance relative to a person's average amount of movement would better capture the idea of relatively slow or fast.
Examples for learning are consistent mappings formed, for instance, by conventional DLM.
Some other works focused on fixed point results for multi-valued mappings are, for instance, [1 5].
It is very useful in establishing the convergence of iterative methods for computing a common fixed point of nonlinear mappings (see, for instance, [23, 25, 27]).
There are important background results on the properties of weak contractive mappings (see, for instance, [1, 2, 34] and references therein).
Especially, some authors have tried to discuss the upper and lower semi-continuity of solution mappings (see, for instance, [19 28] and the reference therein).
Recently, as a generalization of Haugazeau's algorithm, the so-called hybrid projection algorithm was developed rapidly for finding the nearest fixed point of certain quasi-nonexpansive mappings; see, for instance, Bauschke and Combettes [10] and the references therein.
Since 1972, many authors have studied the weak and strong convergence problems of the iterative algorithms for such a class of mappings; see, for instance, [7 9] and the references therein.
Then { x n } n = 1 ∞ is bounded if and only if { x n } n = 1 ∞ converges to a fixed point of T. There are many articles have been published on the iterative methods using for approximation of fixed points of nonlinear mappings, see for instance [1 7].
