On solving the minimization problem and the fixed-point problem for nonexpansive mappings in CAT(0) spaces

© 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...

Full description

Saved in:

Bibliographic Details
Main Authors:	Raweerote Suparatulatorn, Prasit Cholamjiak, Suthep Suantai
Format:	Journal
Published:	2018
Subjects:	Computer Science Mathematics
Online Access:	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84989246664&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/57138
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Chiang Mai University

id	th-cmuir.6653943832-57138
record_format	dspace
spelling	th-cmuir.6653943832-571382018-09-05T03:45:05Z On solving the minimization problem and the fixed-point problem for nonexpansive mappings in CAT(0) spaces Raweerote Suparatulatorn Prasit Cholamjiak Suthep Suantai Computer Science Mathematics © 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. 2018-09-05T03:35:26Z 2018-09-05T03:35:26Z 2017-01-02 Journal 10294937 10556788 2-s2.0-84989246664 10.1080/10556788.2016.1219908 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84989246664&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/57138
institution	Chiang Mai University
building	Chiang Mai University Library
country	Thailand
collection	CMU Intellectual Repository
topic	Computer Science Mathematics
spellingShingle	Computer Science Mathematics Raweerote Suparatulatorn Prasit Cholamjiak Suthep Suantai On solving the minimization problem and the fixed-point problem for nonexpansive mappings in CAT(0) spaces
description	© 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.
format	Journal
author	Raweerote Suparatulatorn Prasit Cholamjiak Suthep Suantai
author_facet	Raweerote Suparatulatorn Prasit Cholamjiak Suthep Suantai
author_sort	Raweerote Suparatulatorn
title	On solving the minimization problem and the fixed-point problem for nonexpansive mappings in CAT(0) spaces
title_short	On solving the minimization problem and the fixed-point problem for nonexpansive mappings in CAT(0) spaces
title_full	On solving the minimization problem and the fixed-point problem for nonexpansive mappings in CAT(0) spaces
title_fullStr	On solving the minimization problem and the fixed-point problem for nonexpansive mappings in CAT(0) spaces
title_full_unstemmed	On solving the minimization problem and the fixed-point problem for nonexpansive mappings in CAT(0) spaces
title_sort	on solving the minimization problem and the fixed-point problem for nonexpansive mappings in cat(0) spaces
publishDate	2018
url	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84989246664&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/57138
_version_	1681424822730489856

On solving the minimization problem and the fixed-point problem for nonexpansive mappings in CAT(0) spaces

Similar Items