[PDF] Top 20 Another type of Mann iterative scheme for two mappings in a complete geodesic space

... The image recovery problem is formulated as to find the nearest point in the intersec- tion of family of closed convex subsets from a given point by using corresponding metric projection of each subset. In this section, ... See full document

... Spacek [16] and Hans [4,5] proved random fixed point results on separable complete metric space and Itoh [6] extended their work to multivalued contraction mappings. Zhung et al. [17] proved almost ... See full document

... new two-step iterative scheme of mixed type for two asymptotically nonexpansive self-mappings and two asymptotically nonexpansive nonself-mappings and prove strong ... See full document

... Recently, Mann-type iterative algorithm and Ishikawa-type iterative algorithm (implicit and explicit) have been considered for the approximation of common fixed points of nonlinear ... See full document

... Agarwal-O’Regan-Sahu type iterative scheme [] for approx- imating a common fixed point of two total asymptotically nonexpansive mappings and two total asymptotically ... See full document

... Recently, Su and Qin [] introduced a monotone projection method for computing fixed points of nonexpansive mappings. A strong convergence theorem was established in the framework of Hilbert spaces; for more ... See full document

... in complete fuzzy metric spaces by using generalized distribution functions have been studied in [, ] and references ...for two new classes of contrac- tive mappings in Menger probabilistic metric ... See full document

... prove two -convergence theorems of the Mann algo- rithm to a common fixed point for a countable family of mappings in complete CAT() ...nonexpansive mappings improves Theorem ... See full document

... nonexpansive mappings in Ba- nach space including Mann type and Ishikawa type iteration processes have been studied extensively by various authors; see [, ...of Mann type ... See full document

... Agarwal-O’Regan-Sahu type iterative scheme introduced in [] from Banach spaces to hyperbolic ...of Mann and Ishikawa iteration pro- ... See full document

... In 2012, K. Ungchittrakool [16] provide some examples of quasi-strict pseudo-contractions related to the function φ in framework of smooth and strictly convex Banach space. He obtained some strong convergence ... See full document

... many iterative methods for solving the variational inequality ...a Mann type iterative scheme for variational inequalities in compact subsets of Banach ... See full document

... hybrid iterative process ...contractive type operator defined in ...hybrid iterative process (.) and the random Mann itera- tive process ... See full document

... and Mann iterative algorithms have been considered for approximations of common fixed points by many ...modified Mann iterative scheme by using the generalized f -projection method for ... See full document

... of another iterative algorithm by the hy- brid Mann-type viscosity method for finding a solution of the system of generalized equi- librium problems with constraints of several problems: a ... See full document

... Main Results In this section, we prove weak and strong convergence theorems of the iterative scheme 1.1 for a finite family of nonexpansive mappings in a uniformly convex Banach space.. [r] ... See full document

... Afterwards, many authors continued the study of Branciari and obtained many fixed point theorems for several classes of contractive mappings of integral type; see, e.g., [– ] and the references therein. In ... See full document

... nonexpansive mappings. In this paper, we study the iterative scheme given in () for weak and strong convergence for a pair of nonexpansive mappings in a uniformly convex Banach ... See full document

... composite Mann-type viscosity it- erative algorithm for finding a solution of the THVIP ...Hilbert space. This algorithm is based on Mann?s iteration method, Korpelevich?s extragradient method, ... See full document

... analyze iterative algorithms for solving not only feasibility and optimization problems, but also algorithms for solving variational inequalities, for approximating equilibria, for computing fixed points of ... See full document