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 |
---|---|
Format: | Journal |
Published: |
2020
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85072312287&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67901 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces
by: Nguyen The Vinh, et al.
Published: (2019) -
The modified inertial relaxed CQ algorithm for solving the split feasibility problems
by: Suthep Suantai, et al.
Published: (2018) -
Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
by: Suthep Suantai, et al.
Published: (2019) -
Modified proximal algorithms for finding solutions of the split variational inclusions
by: Suthep Suantai, et al.
Published: (2019) -
Algorithms for solving generalized equilibrium problems and fixed points of nonexpansive semigroups in Hilbert spaces
by: Suthep Suantai, et al.
Published: (2018)