A new hybrid CQ algorithm for the split feasibility problem in Hilbert spaces and its applications to compressed sensing

• Main Authors: Suthep Suantai, Suparat Kesornprom, Prasit Cholamjiak
• Format: Journal
• Published: 2020
• Subjects: Mathematics
• Online Access: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85072312287&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/67901
• Institution: Chiang Mai University

© 2019 by the authors. In this paper, we focus on studying the split feasibility problem (SFP), which has many applications in signal processing and image reconstruction. A popular technique is to employ the iterative method which is so called the relaxed CQ algorithm. However, the speed of convergence usually depends on the way of selecting the step size of such algorithms. We aim to suggest a new hybrid CQ algorithm for the SFP by using the self adaptive and the line-search techniques. There is no computation on the inverse and the spectral radius of a matrix. We then prove the weak convergence theorem under mild conditions. Numerical experiments are included to illustrate its performance in compressed sensing. Some comparisons are also given to show the efficiency with other CQ methods in the literature.