New Inertial Relaxed CQ Algorithms for Solving Split Feasibility Problems in Hilbert Spaces
The split feasibility problem SFP has received much attention due to its various applications in signal processing and image reconstruction. In this paper, we propose two inertial relaxed CQ algorithms for solving the split feasibility problem in real Hilbert spaces according to the previous experie...
Saved in:
| Main Authors: | Haiying Li, Yulian Wu, Fenghui Wang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/6624509 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Inertial CQ Algorithm With Correction Terms for Split Feasibility Problems With Multiple Output Sets
by: Yang Liu, et al.
Published: (2025-01-01) -
Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces
by: Hasanen A. Hammad, et al.
Published: (2021-01-01) -
General Split Feasibility Problems in Hilbert Spaces
by: Mohammad Eslamian, et al.
Published: (2013-01-01) -
Strong Convergence Theorems of the CQ Algorithm for H-Monotone Operators in Hilbert Spaces
by: Huimin He, et al.
Published: (2014-01-01) -
An Efficient Iterative Algorithm for Solving the Split Feasibility Problem in Hilbert Spaces Applicable in Image Deblurring, Signal Recovering, and Polynomiography
by: Lanchakorn Kittiratanawasin, et al.
Published: (2023-01-01)