A Relaxed Self-Adaptive Projection Algorithm for Solving the Multiple-Sets Split Equality Problem
In this article, we introduce a relaxed self-adaptive projection algorithm for solving the multiple-sets split equality problem. Firstly, we transfer the original problem to the constrained multiple-sets split equality problem and a fixed point equation system is established. Then, we show the equiv...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Journal of Function Spaces |
| Online Access: | http://dx.doi.org/10.1155/2020/6183214 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this article, we introduce a relaxed self-adaptive projection algorithm for solving the multiple-sets split equality problem. Firstly, we transfer the original problem to the constrained multiple-sets split equality problem and a fixed point equation system is established. Then, we show the equivalence of the constrained multiple-sets split equality problem and the fixed point equation system. Secondly, we present a relaxed self-adaptive projection algorithm for the fixed point equation system. The advantage of the self-adaptive step size is that it could be obtained directly from the iterative procedure. Furthermore, we prove the convergence of the proposed algorithm. Finally, several numerical results are shown to confirm the feasibility and efficiency of the proposed algorithm. |
|---|---|
| ISSN: | 2314-8896 2314-8888 |