Photo from wikipedia
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… Click to show full abstract
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 our algorithm is effective. Our results are applied to solve image deblurring and signal recovery problems. Furthermore, we show the use of the proposed method to generate polynomiographs.
Keywords:
image deblurring;
feasibility problem;
efficient iterative;
deblurring signal;
split feasibility;
hilbert spaces
Journal Title: Journal of Mathematics
Year Published: 2023
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Mathematics
Year Published: 2023
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!