Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/71548
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Suthep Suantai | en_US |
dc.contributor.author | Pachara Jailoka | en_US |
dc.date.accessioned | 2021-01-27T03:53:58Z | - |
dc.date.available | 2021-01-27T03:53:58Z | - |
dc.date.issued | 2020-12-01 | en_US |
dc.identifier.issn | 15729036 | en_US |
dc.identifier.issn | 01678019 | en_US |
dc.identifier.other | 2-s2.0-85092212094 | en_US |
dc.identifier.other | 10.1007/s10440-020-00362-6 | en_US |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85092212094&origin=inward | en_US |
dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/71548 | - |
dc.description.abstract | © 2020, Springer Nature B.V. In this work, we study the split null point problem and the fixed point problem in Hilbert spaces. We introduce a self-adaptive algorithm based on the viscosity approximation method without prior knowledge of the operator norm for finding a common solution of the considered problem for maximal monotone mappings and demicontractive multivalued mappings. A strong convergence result of our proposed algorithm is established under some suitable conditions. Some convergence results for the split feasibility problem and the split minimization problem are consequences of our main result. Finally, we also give numerical examples for supporting our main result. | en_US |
dc.subject | Mathematics | en_US |
dc.title | A Self-Adaptive Algorithm for Split Null Point Problems and Fixed Point Problems for Demicontractive Multivalued Mappings | en_US |
dc.type | Journal | en_US |
article.title.sourcetitle | Acta Applicandae Mathematicae | en_US |
article.volume | 170 | 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.