Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces
The goal of this manuscript is to establish strong convergence theorems for inertial shrinking projection and CQ algorithms to solve a split convex feasibility problem in real Hilbert spaces. Finally, numerical examples were obtained to discuss the performance and effectiveness of our algorithms and...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Function Spaces |
| Online Access: | http://dx.doi.org/10.1155/2021/5562694 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The goal of this manuscript is to establish strong convergence theorems for inertial shrinking projection and CQ algorithms to solve a split convex feasibility problem in real Hilbert spaces. Finally, numerical examples were obtained to discuss the performance and effectiveness of our algorithms and compare the proposed algorithms with the previous shrinking projection, hybrid projection, and inertial forward-backward methods. |
|---|---|
| ISSN: | 2314-8896 2314-8888 |