TY - JOUR
T1 - Weak and Strong Convergence of Two Algorithms for the Split Fixed Point Problem
JO - Numerical Mathematics: Theory, Methods and Applications
VL - 4
SP - 770
EP - 781
PY - 2018
DA - 2018/06
SN - 11
DO - http://doi.org/10.4208/nmtma.2018.s05
UR - https://global-sci.org/intro/article_detail/nmtma/12471.html
KW - 
AB - <p style="text-align: justify;">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.</p>