Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/71555
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPachara Jailokaen_US
dc.contributor.authorSuthep Suantaien_US
dc.date.accessioned2021-01-27T03:54:38Z-
dc.date.available2021-01-27T03:54:38Z-
dc.date.issued2020-01-01en_US
dc.identifier.issn03545180en_US
dc.identifier.other2-s2.0-85097922273en_US
dc.identifier.other10.2298/FIL2003761Jen_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85097922273&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/71555-
dc.description.abstract© 2020, University of Nis. All rights reserved. In this work, we study the split common fixed point problem which was first introduced by Censor and Segal [14]. We introduce an algorithm based on the viscosity approximation method without prior knowledge of the operator norm by selecting the stepsizes in the same adaptive way as López et al. [22] for solving the problem for two attracting quasi-nonexpansive operators in real Hilbert spaces. A strong convergence result of the proposed algorithm is established under some suitable conditions. We also modify our algorithm to extend to the class of demicontractive operators and the class of hemicontractive operators, and obtain strong convergence results. Moreover, we apply our main result to other split problems, that is, the split feasibility problem and the split variational inequality problem. Finally, a numerical result is also given to illustrate the convergence behavior of our algorithm.en_US
dc.subjectMathematicsen_US
dc.titleViscosity approximation methods for split common fixed point problems without prior knowledge of the operator normen_US
dc.typeJournalen_US
article.title.sourcetitleFilomaten_US
article.volume34en_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.