Cited 8 time in
The numerical reckoning of modified proximal point methods for minimization problems in non-positive curvature metric spaces
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Thounthong, Phatiphat | - |
| dc.contributor.author | Pakkaranang, Nuttapol | - |
| dc.contributor.author | Cho, Yeol Je | - |
| dc.contributor.author | Kumam, Wiyada | - |
| dc.contributor.author | Kumam, Poom | - |
| dc.date.accessioned | 2024-12-02T21:31:07Z | - |
| dc.date.available | 2024-12-02T21:31:07Z | - |
| dc.date.issued | 2020-02 | - |
| dc.identifier.issn | 0020-7160 | - |
| dc.identifier.issn | 1029-0265 | - |
| dc.identifier.uri | https://scholarworks.gnu.ac.kr/handle/sw.gnu/72044 | - |
| dc.description.abstract | In this paper, we introduce a new modified proximal point algorithm for nonexpansive mappings in non-positive curvature metric spaces and also we prove the sequence generated by the proposed algorithms converges to a common solution between minimization problem and fixed point problem. Moreover, we give some numerical examples to illustrate our main results, that is, our algorithm is more efficient than the algorithm of Cholamjiak et al. and others. | - |
| dc.format.extent | 18 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Taylor & Francis | - |
| dc.title | The numerical reckoning of modified proximal point methods for minimization problems in non-positive curvature metric spaces | - |
| dc.type | Article | - |
| dc.publisher.location | 영국 | - |
| dc.identifier.doi | 10.1080/00207160.2018.1551527 | - |
| dc.identifier.scopusid | 2-s2.0-85058090352 | - |
| dc.identifier.wosid | 000505888300018 | - |
| dc.identifier.bibliographicCitation | International Journal of Computer Mathematics, v.97, no.1-2, pp 245 - 262 | - |
| dc.citation.title | International Journal of Computer Mathematics | - |
| dc.citation.volume | 97 | - |
| dc.citation.number | 1-2 | - |
| dc.citation.startPage | 245 | - |
| dc.citation.endPage | 262 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Mathematics | - |
| dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
| dc.subject.keywordPlus | ASYMPTOTICALLY NONEXPANSIVE-MAPPINGS | - |
| dc.subject.keywordPlus | DELTA-CONVERGENCE THEOREMS | - |
| dc.subject.keywordPlus | FIXED-POINTS | - |
| dc.subject.keywordAuthor | CAT(0) spaces | - |
| dc.subject.keywordAuthor | proximal point algorithm | - |
| dc.subject.keywordAuthor | iterative method | - |
| dc.subject.keywordAuthor | nonexapnsive mappings | - |
| dc.subject.keywordAuthor | convex minimization problem | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Gyeongsang National University Central Library, 501, Jinju-daero, Jinju-si, Gyeongsangnam-do, 52828, Republic of Korea+82-55-772-0532
COPYRIGHT 2022 GYEONGSANG NATIONAL UNIVERSITY LIBRARY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
