An Efficient Iterative Algorithm for Solving the Split Feasibility Problem in Hilbert Spaces Applicable in Image Deblurring, Signal Recovering, and Polynomiography
The split feasibility problem (SFP) in Hilbert spaces is addressed in this study using an efficient iterative approach. Under mild conditions, we prove convergence theorems for the algorithm for finding a solution to the SFP. We also present numerical examples to illustrate that the acceleration of...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2023-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2023/4934575 |