Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems

• Main Authors: Suthep Suantai, Nattawut Pholasa, Prasit Cholamjiak
• Format: Journal
• Published: 2019
• Subjects: Mathematics
• Online Access: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85064718721&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/65681
• Institution: Chiang Mai University

© 2018, Springer-Verlag Italia S.r.l., part of Springer Nature. 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.