Three-step projective methods for solving the split feasibility problems

© 2019 by the authors. In this paper, we focus on studying the split feasibility problem (SFP) in Hilbert spaces. Based on the CQ algorithm involving the self-adaptive technique, we introduce a three-step iteration process for approximating the solution of SFP. Then, the convergence results are esta...

Full description

Saved in:
Bibliographic Details
Main Authors: Suthep Suantai, Nontawat Eiamniran, Nattawut Pholasa, Prasit Cholamjiak
Format: Journal
Published: 2019
Subjects:
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85070438563&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/66704
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
Description
Summary:© 2019 by the authors. In this paper, we focus on studying the split feasibility problem (SFP) in Hilbert spaces. Based on the CQ algorithm involving the self-adaptive technique, we introduce a three-step iteration process for approximating the solution of SFP. Then, the convergence results are established under mild conditions. Numerical experiments are provided to show the efficiency in signal processing. Some comparisons to various methods are also provided in this paper.