Iterative Algorithms for Split Common Fixed Point Problem Involved in Pseudo-Contractive Operators without Lipschitz Assumption
Keyword(s):
Two iterative algorithms are suggested for approximating a solution of the split common fixed point problem involved in pseudo-contractive operators without Lipschitz assumption. We prove that the sequence generated by the first algorithm converges weakly to a solution of the split common fixed point problem and the second one converges strongly. Moreover, the sequence { x n } generated by Algorithm 3 strongly converges to z = proj S 0 , which is the minimum-norm solution of problem (1). Numerical examples are included.
2014 ◽
Vol 2014
(1)
◽