Author:
Wang Yuanheng,Huang Bin,Jiang Bingnan,Xu Tiantian,Wang Ke
Abstract
<abstract><p>In this paper, we introduce a new hybrid relaxed iterative algorithm with two half-spaces to solve the fixed-point problem and split-feasibility problem involving demicontractive mappings. The strong convergence of the iterative sequence produced by our algorithm is proved under certain weak conditions. We give several numerical experiments to demonstrate the efficiency of the proposed iterative method in comparison with previous algorithms.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference23 articles.
1. Y. Censor, T. Elfving, A multiprojection algorithm using Bregman projections in a product space, Numer. Algor., 8 (1994), 221–239. https://doi.org/10.1007/BF02142692
2. Y. Yao, M. Postolache, X. Qin, J. Yao, Iterative algorithms for the proximal split feasibility problem, U. P. B. Sci. Bull. A, 80 (2018), 37–44.
3. A. E. Al-Mazrooei, A. Latif, X. Qin, J. C. Yao, Fixed point algorithms for split feasibility problems, Fixed Point Theor., 20 (2019), 245–254. https://doi.org/10.24193/fpt-ro.2019.1.16
4. Q. Dong, S. He, Y. Zhao, On global convergence rate of two acceleration projection algorithms for solving the multiple-sets split feasibility problem, Filomat, 30 (2016), 3243–3252. https://doi.org/10.2298/FIL1612243D
5. J. Zhao, D. Hou, A self-adaptive iterative algorithm for the split common fixed problems, Numer Algor., 82 (2019), 1047–1063. https://doi.org/10.1007/s11075-018-0640-x