- Journal Home
- Volume 18 - 2025
- Volume 17 - 2024
- Volume 16 - 2023
- Volume 15 - 2022
- Volume 14 - 2021
- Volume 13 - 2020
- Volume 12 - 2019
- Volume 11 - 2018
- Volume 10 - 2017
- Volume 9 - 2016
- Volume 8 - 2015
- Volume 7 - 2014
- Volume 6 - 2013
- Volume 5 - 2012
- Volume 4 - 2011
- Volume 3 - 2010
- Volume 2 - 2009
- Volume 1 - 2008
Numer. Math. Theor. Meth. Appl., 11 (2018), pp. 770-781.
Published online: 2018-06
Cited by
- BibTex
- RIS
- TXT
Two iterative algorithms are proposed for the split fixed point problem. The first algorithm is shown to be weakly convergent and the second one to be strongly convergent. One feature of these algorithms is that the step sizes are chosen in such a way that no priori knowledge of the operator norms is required. A new idea is introduced in order to prove strong convergence of the second algorithm.
}, issn = {2079-7338}, doi = {https://doi.org/10.4208/nmtma.2018.s05}, url = {http://global-sci.org/intro/article_detail/nmtma/12471.html} }Two iterative algorithms are proposed for the split fixed point problem. The first algorithm is shown to be weakly convergent and the second one to be strongly convergent. One feature of these algorithms is that the step sizes are chosen in such a way that no priori knowledge of the operator norms is required. A new idea is introduced in order to prove strong convergence of the second algorithm.