当前位置: X-MOL 学术RACSAM › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An algorithm for the split feasible problem and image restoration
Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas ( IF 2.9 ) Pub Date : 2020-10-31 , DOI: 10.1007/s13398-020-00942-z
Raweerote Suparatulatorn , Phakdi Charoensawan , Kanyuta Poochinapan , Supreedee Dangskul

This paper proposes an accelerated algorithm for the split common fixed point problem, based on viscosity approximation methods and inertial effects. The main result will be applied to image restoration problems. This algorithm is constructed in such a way that its step sizes and the norm of a given linear operator are not related. Under some conditions, the strong convergence of the algorithm is obtained. Numerical investigations are carried out in order to illustrate high-performance of the present work, mainly using processing duration and the signal-to-noise ratio. It is also shown that this proposed algorithm is more efficient and effective than the published algorithm by Yao et al.

中文翻译:

分割可行问题的一种算法和图像恢复

本文提出了一种基于粘度近似方法和惯性效应的分裂公共不动点问题的加速算法。主要结果将应用于图像恢复问题。该算法的构建方式使得其步长与给定线性算子的范数无关。在一定条件下,获得了算法的强收敛性。进行数值研究以说明当前工作的高性能,主要使用处理持续时间和信噪比。还表明,该算法比 Yao 等人发表的算法更有效。
更新日期:2020-10-31
down
wechat
bug