A Tseng-type algorithm for approximating zeros of monotone inclusion and J -fixed-point problems with applications

Fixed Point Theory and Algorithms for Sciences and Engineering(2023)

引用 0|浏览0
暂无评分
摘要
In this paper, a Halpern–Tseng-type algorithm for approximating zeros of the sum of two monotone operators whose zeros are J -fixed points of relatively J -nonexpansive mappings is introduced and studied. A strong convergence theorem is established in Banach spaces that are uniformly smooth and 2-uniformly convex. Furthermore, applications of the theorem to convex minimization and image-restoration problems are presented. In addition, the proposed algorithm is used in solving some classical image-recovery problems and a numerical example in a Banach space is presented to support the main theorem. Finally, the performance of the proposed algorithm is compared with that of some existing algorithms in the literature.
更多
查看译文
关键词
Zeros,J-fixed point,Convex minimization,Image restoration
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要