Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/57138Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Raweerote Suparatulatorn | en_US |
| dc.contributor.author | Prasit Cholamjiak | en_US |
| dc.contributor.author | Suthep Suantai | en_US |
| dc.date.accessioned | 2018-09-05T03:35:26Z | - |
| dc.date.available | 2018-09-05T03:35:26Z | - |
| dc.date.issued | 2017-01-02 | en_US |
| dc.identifier.issn | 10294937 | en_US |
| dc.identifier.issn | 10556788 | en_US |
| dc.identifier.other | 2-s2.0-84989246664 | en_US |
| dc.identifier.other | 10.1080/10556788.2016.1219908 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84989246664&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/57138 | - |
| dc.description.abstract | © 2016 Informa UK Limited, trading as Taylor & Francis Group. We propose a new modified proximal point algorithm combined with Halpern's iteration process for nonexpansive mappings in the framework of CAT(0) spaces. We establish a strong convergence theorem under some mild conditions. Our results extend some known results which appeared in the literature. | en_US |
| dc.subject | Computer Science | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | On solving the minimization problem and the fixed-point problem for nonexpansive mappings in CAT(0) spaces | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | Optimization Methods and Software | en_US |
| article.volume | 32 | 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.