Strong convergence algorithms of the split common fixed point problem for total quasi-asymptotically pseudocontractive operators (Q1723824)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Strong convergence algorithms of the split common fixed point problem for total quasi-asymptotically pseudocontractive operators
scientific article

    Statements

    Strong convergence algorithms of the split common fixed point problem for total quasi-asymptotically pseudocontractive operators (English)
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    Summary: We present a new algorithm for solving the two-set split common fixed point problem with total quasi-asymptotically pseudocontractive operators and consider the case of quasi-pseudocontractive operators. Under some appropriate conditions, we prove that the proposed algorithms have strong convergence. The results presented in this paper improve and extend the previous algorithms and results in [\textit{Y. Censor} and \textit{A. Segal}, J. Convex Anal. 16, No. 2, 587--600 (2009; Zbl 1189.65111); \textit{A. Moudafi}, Nonlinear Anal., Theory Methods Appl., Ser. A, Theory Methods 74, No. 12, 4083--4087 (2011; Zbl 1232.49017); Inverse Probl. 26, No. 5, Article ID 055007, 6 p. (2010; Zbl 1219.90185); \textit{L. B. Mohammed} et al., ``Strong convergence of an algorithm about quasi-nonexpansive mappings for the split common fixed-pint problem in Hilbert space'', J. Nat. Sci. Res. 3, No. 7, 215--220 (2013), \url{https://www.iiste.org/Journals/index.php/JNSR/article/view/6434}; \textit{L. Yang} et al., Fixed Point Theory Appl. 2011, Paper No. 77, 11 p. (2011; Zbl 1311.47101); \textit{S.-S. Chang} et al., ibid. 2012, Article ID 491760, 12 p. (2012; Zbl 1234.47047)] and others.
    0 references
    two-set split common fixed point problem
    0 references
    total quasi-asymptotically pseudocontractive operators
    0 references
    quasi-pseudocontractive operators
    0 references
    strong convergence
    0 references
    0 references
    0 references

    Identifiers