Iterative Algorithms for Split Common Fixed Point Problem Involved in Pseudo-Contractive Operators without Lipschitz Assumption.
- Resource Type
- Article
- Authors
- Chen, Jinzuo; Postolache, Mihai; Zhu, Li-Jun
- Source
- Mathematics (2227-7390). Sep2019, Vol. 7 Issue 9, p777. 1p.
- Subject
- *ALGORITHMS
*HYPOTHESIS
- Language
- ISSN
- 2227-7390
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. [ABSTRACT FROM AUTHOR]