Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/67898
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Suthep Suantai | en_US |
dc.contributor.author | Narin Petrot | en_US |
dc.contributor.author | Montira Suwannaprapa | en_US |
dc.date.accessioned | 2020-04-02T15:10:30Z | - |
dc.date.available | 2020-04-02T15:10:30Z | - |
dc.date.issued | 2019-11-01 | en_US |
dc.identifier.issn | 22277390 | en_US |
dc.identifier.other | 2-s2.0-85075360758 | en_US |
dc.identifier.other | 10.3390/math7111012 | en_US |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85075360758&origin=inward | en_US |
dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/67898 | - |
dc.description.abstract | © 2019 by the authors. We consider the split feasibility problem in Hilbert spaces when the hard constraint is common solutions of zeros of the sum of monotone operators and fixed point sets of a finite family of nonexpansive mappings, while the soft constraint is the inverse image of a fixed point set of a nonexpansive mapping. We introduce iterative algorithms for the weak and strong convergence theorems of the constructed sequences. Some numerical experiments of the introduced algorithm are also discussed. | en_US |
dc.subject | Mathematics | en_US |
dc.title | Iterative methods for finding solutions of a class of split feasibility problems over fixed point sets in Hilbert spaces | en_US |
dc.type | Journal | en_US |
article.title.sourcetitle | Mathematics | en_US |
article.volume | 7 | en_US |
article.stream.affiliations | Rajamangala University of Technology Lanna | en_US |
article.stream.affiliations | Naresuan University | 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.