Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/66704Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Suthep Suantai | en_US |
| dc.contributor.author | Nontawat Eiamniran | en_US |
| dc.contributor.author | Nattawut Pholasa | en_US |
| dc.contributor.author | Prasit Cholamjiak | en_US |
| dc.date.accessioned | 2019-09-16T12:55:42Z | - |
| dc.date.available | 2019-09-16T12:55:42Z | - |
| dc.date.issued | 2019-01-01 | en_US |
| dc.identifier.issn | 22277390 | en_US |
| dc.identifier.other | 2-s2.0-85070438563 | en_US |
| dc.identifier.other | 10.3390/math7080712 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85070438563&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/66704 | - |
| dc.description.abstract | © 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. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | Three-step projective methods for solving the split feasibility problems | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | Mathematics | en_US |
| article.volume | 7 | en_US |
| article.stream.affiliations | University of Phayao | en_US |
| article.stream.affiliations | Chiang Mai University | en_US |
| Appears in Collections: | CMUL: Journal Articles | |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.