Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/71931
Title: An algorithm for the split feasible problem and image restoration
Authors: Raweerote Suparatulatorn
Phakdi Charoensawan
Kanyuta Poochinapan
Supreedee Dangskul
Keywords: Mathematics
Issue Date: 1-Jan-2021
Abstract: © 2020, The Royal Academy of Sciences, Madrid. 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.
URI: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85094663880&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/71931
ISSN: 15791505
15787303
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.