Journal
REVISTA DE LA REAL ACADEMIA DE CIENCIAS EXACTAS FISICAS Y NATURALES SERIE A-MATEMATICAS
Volume 113, Issue 2, Pages 1081-1099Publisher
SPRINGER-VERLAG ITALIA SRL
DOI: 10.1007/s13398-018-0535-7
Keywords
Inertial relaxed CQ algorithm; Halpern's iteration process; Multiple-sets split feasibility problem; Self-adaptive method
Categories
Funding
- Thailand Research Fund
- Commission on Higher Education [MRG5980248]
- Chiang Mai University
Ask authors/readers for more resources
In this work, we introduce the inertial relaxed CQ algorithms for solving the multiple-sets split feasibility problems (MSFP) in the frameworks of Hilbert spaces. By mixing the inertial technique with the self-adaptive method, not only the computation on the matrix norm and the orthogonal projection is relaxed but also the convergence speed is improved. We then establish the strong convergence theorem by combining the relaxed CQ algorithm with Halpern's iteration process. Finally, we provide numerical experiments to illustrate the convergence behavior and the effectiveness of our proposed algorithm. The main result extends and improves the corresponding results.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available