Strong Convergence of Modified Inertial Mann Algorithms for Nonexpansive Mappings
نویسندگان
چکیده
منابع مشابه
Weak Convergence of Mann Iterative Algorithm for two Nonexpansive mappings
The mann fixed point algorithm play an importmant role in the approximation of fixed points of nonexpansive operators. In this paper, by considering new conditions, we prove the weak convergence of mann fixed point algorithm, for finding a common fixed point of two nonexpansive mappings in real Hilbert spaces. This results extend the privious results given by Kanzow and Shehu. Finally, we give ...
متن کاملStrong Convergence Theorems of Modified Mann Iterative Process for Nonexpansive Mappings in Hilbert Spaces
The purpose of this article is to modify normal Mann’s iterative process to have strong convergence for nonexpansive mappings in the formework of Hilbert spaces. We prove the strong convergence of the proposed iterative algorithm to the fixed point of nonexpansive mappings which is the unique solution of a variational inequality, which is also the optimality condition for a minimization problem.
متن کاملStrong convergence of modified iterative algorithm for family of asymptotically nonexpansive mappings
In this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regular asymptotically nonexpansive mappings in a real reflexive Banach space with a uniformly G$hat{a}$teaux differentiable norm. Our result is applicable in $L_{p}(ell_{p})$ spaces, $1 < p
متن کاملStrong Convergence of a Modified Halpern’s Iteration for Nonexpansive Mappings
A mapping T : C → C is said to be nonexpansive if ‖Tx − Ty‖ ≤ ‖x − y‖, for all x, y ∈ C. We denote by Fix T {x ∈ C : Tx x} the set of fixed points of T . In the last ten years, many papers have been written on the approximation of fixed point for nonlinear mappings by using some iterative processes see, e.g., 1–18 . An explicit iterative process was initially introduced, in 1967, by Halpern 3 i...
متن کاملModified Mann-Halpern Algorithms for Pseudocontractive Mappings
and Applied Analysis 3 We know that T is pseudocontractive if and only if T satisfies the condition Tx − Ty 2 ≤ x − y 2 + (I − T)x − (I − T)y 2 (15) for all x, y ∈ C. Since u ∈ Fix(T), we have from (15) that ‖Tx − u‖ 2 ≤ ‖x − u‖ 2 + ‖x − Tx‖ 2 , (16) for all x ∈ C. By using (13) and (16), we obtain Tyn − u 2 ≤ yn − u 2 + yn − Tyn 2 = (1 − γn)xn + γnT...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8040462