A Modified CQ Algorithm for Solving the Multiple-Sets Split Feasibility Problem and the Fixed Point Problem for Nonexpansive Mappings

Suparat Kesornprom, Nattawut Pholasa, Prasit Cholamjiak

Authors

  • Support Team

Keywords:

multiple-sets split feasibility problem, relaxed CQ algorithm, Hilbert space, weak and strong convergence, fixed point problem

Abstract

In this work, we  propose a new relaxed CQ algorithm for solving the  multiple-sets split feasibility problem (MSFP) and the fixed point problem for nonexpansive mappings. We obtain  weak and strong convergence theorems of the proposed algorithm  in  Hilbert spaces. Finally, we provide numerical experiments to show the efficiency of our algorithm.

Downloads

Published

2019-08-01

How to Cite

Team, S. (2019). A Modified CQ Algorithm for Solving the Multiple-Sets Split Feasibility Problem and the Fixed Point Problem for Nonexpansive Mappings: Suparat Kesornprom, Nattawut Pholasa, Prasit Cholamjiak. Thai Journal of Mathematics, 17(2), 475–493. Retrieved from https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/905

Issue

Vol. 17 No. 2 (2019): August

Section

Articles