Author:
Wattanataweekul Rattanakorn,Janngam Kobkoon
Abstract
AbstractIn this paper, we define a new concept of left and right coordinate affine of a directed graph and then employ it to introduce a new accelerated common fixed point algorithm for a countable family ofG-nonexpansive mappings in a real Hilbert space with a graph. We prove, under certain conditions, weak convergence theorems for the proposed algorithm. As applications, we also apply our results to solve convex minimization and image restoration problems. Moreover, we show that our algorithm provides better convergence behavior than other methods in the literature.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis
Reference38 articles.
1. Bin Dehaish, B.A., Khamsi, M.A.: Mann iteration process for monotone nonexpansive mappings. Fixed Point Theory Appl. 2015, 177 (2015)
2. Dong, Y.: New inertial factors of the Krasnosel’skii–Mann iteration. Set-Valued Var. Anal. 29, 145–161 (2021)
3. Mann, W.R.: Mean value methods in iteration. Proc. Am. Math. Soc. 4, 506–510 (1953)
4. Ishikawa, S.: Fixed points by a new iteration method. Proc. Am. Math. Soc. 44, 147–150 (1974)
5. Agarwal, R.P., O’Regan, D., Sahu, D.R.: Iterative construction of fixed point of nearly asymptotically nonexpansive mappings. J. Nonlinear Convex Anal. 8, 61–79 (2007)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献