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

© 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 converge...

全面介紹

Saved in:
書目詳細資料
Main Authors: Suthep Suantai, Suparat Kesornprom, Prasit Cholamjiak
格式: 雜誌
出版: 2020
主題:
在線閱讀:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85072312287&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/67901
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Chiang Mai University