Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/67911
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJenwit Puangpeeen_US
dc.contributor.authorSuthep Suantaien_US
dc.date.accessioned2020-04-02T15:11:14Z-
dc.date.available2020-04-02T15:11:14Z-
dc.date.issued2019-01-01en_US
dc.identifier.issn03545180en_US
dc.identifier.other2-s2.0-85078289053en_US
dc.identifier.other10.2298/FIL1908381Pen_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85078289053&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/67911-
dc.description.abstract© 2019, University of Nis. All rights reserved. In this paper, we introduce two hybrid algorithms for finding a common best proximity point of two best proximally nonexpansive mappings. We establish strong convergence theorems of the proposed algorithms under some control conditions in a real Hilbert space. Moreover, some numerical examples are given for supporting our main theorems.en_US
dc.subjectMathematicsen_US
dc.titleNew hybrid algorithms for global minimization of common best proximity points of some generalized nonexpansive mappingsen_US
dc.typeJournalen_US
article.title.sourcetitleFilomaten_US
article.volume33en_US
article.stream.affiliationsChiang Mai Universityen_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.