Three-Step Projective Methods for Solving the Split Feasibility Problems

Suthep Suantai, Nontawat Eiamniran, Nattawut Pholasa and Prasit Cholamjiak
Additional contact information
Suthep Suantai: Data Science Research Center, Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand
Nontawat Eiamniran: Demonstration School, University of Phayao, Phayao 56000, Thailand
Nattawut Pholasa: School of Science, University of Phayao, Phayao 56000, Thailand
Prasit Cholamjiak: School of Science, University of Phayao, Phayao 56000, Thailand

Mathematics, 2019, vol. 7, issue 8, 1-15

Abstract: 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.

Keywords: self-adaptive technique; split feasibility problem; convergence theorems; Hilbert space; CQ algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://www.mdpi.com/2227-7390/7/8/712/pdf (application/pdf)
https://www.mdpi.com/2227-7390/7/8/712/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:7:y:2019:i:8:p:712-:d:255306

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().