Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm

作     者：Kankam, Kunrada Srinak, Pittaya Cholamjiak, Prasit Pholasa, Nattawut 

作者机构：Univ Phayao Sch Sci Mae Ka 56000 Phayao Thailand 

出 版 物：《RENDICONTI DEL CIRCOLO MATEMATICO DI PALERMO》 (巴勒摩数学会报告)

年 卷 期：2020年第69卷第3期

页      面：1131-1148页

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：Thailand Research Fund University of Phayao [RSA6180084] Unit of Excellence, University of Phayao [UOE62001] 

主　　题：Multiple-set split feasibility problem Equilibrium problem Relaxed CQ algorithm Hilbert space Weak and strong convergence Bounded linear operator 

摘      要：In this paper, we introduce a new kind of a relaxed CQ algorithm to find the solution of the multiple-set split feasibility problem and the equilibrium problem in a Hilbert space. We prove weak and strong convergence theorems to the proposed algorithm under some mild conditions. Finally, we provide some numerical experiments to show the efficiency and the implementation of our method.