Ball-relaxed projection algorithms for multiple-sets split feasibility problem

References

• Censor Y, Elfving T, Kopf N, et al. The multiple-sets split feasibility problem and its applications for inverse problems. Inverse Probl. 2005;21(6):2071.
   Web of Science ®Google Scholar
• Cegielski A. General method for solving the split common fixed point problem. J Optim Theory App. 2015;165(2):385–404.
   Web of Science ®Google Scholar
• Censor Y, Segal A. The split common fixed point problem for directed operators. J Convex Anal. 2009;16(2):587–600.
   Web of Science ®Google Scholar
• Kraikaew R, Saejung S. On split common fixed point problems. J Math Anal Appl. 2014;415(2):513–524.
   Web of Science ®Google Scholar
• Moudafi A. The split common fixed-point problem for demicontractive mappings. Inverse Probl. 2010;26(5):055007.
   Web of Science ®Google Scholar
• He S, Zhao Z, Luo B. A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem. Optimization. 2015;64(9):1907–1918.
   Web of Science ®Google Scholar
• Buong N. Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces. Numer Algorithms. 2017;76(3):783–798.
   Web of Science ®Google Scholar
• Shehu Y. Strong convergence theorem for multiple sets split feasibility problems in Banach spaces. Numer Funct Anal Optim. 2016;37(8):1021–1036.
   Web of Science ®Google Scholar
• Dong Q, Tang Y, Cho Y, et al. ‘Optimal’ choice of the step length of the projection and contraction methods for solving the split feasibility problem. J Global Optim. 2018;71(2):341–360.
   Web of Science ®Google Scholar
• Yao Y, Leng L, Postolache M, et al. Mann-type iteration method for solving the split common fixed point problem. J Nonlinear Convex Anal. 2017;18(5):875–882.
   Web of Science ®Google Scholar
• Yao Y, Liou YC, Postolache M. Self-adaptive algorithms for the split problem of the demicontractive operators. Optimization. 2018;67(9):1309–1319.
   Web of Science ®Google Scholar
• Raeisi M, Zamani Eskandani G, Eslamian M. A general algorithm for multiple-sets split feasibility problem involving resolvents and Bregman mappings. Optimization. 2018;67(2):309–327.
   Web of Science ®Google Scholar
• Dong QL, He S, Zhao Y. On global convergence rate of two acceleration projection algorithms for solving the multiple-sets split feasibility problem. Filomat. 2016;30(12):3243–3252.
   Web of Science ®Google Scholar
• Dang Y, Xue Z. Iterative process for solving a multiple-set split feasibility problem. J Inequal Appl. 2015;2015(1):47.
   Web of Science ®Google Scholar
• Maingé PE. Strong convergence of projected reflected gradient methods for variational inequalities. Fixed Point Theory. 2018;19(2):659–680.
   Web of Science ®Google Scholar
• Takahashi W, Wen C, Yao J. An implicit algorithm for the split common fixed point problem in Hilbert spaces and applications. Appl Anal Optim. 2017;1(3):423–439.
   Google Scholar
• Al-Mazrooei A, Latif A, Qin X, et al. Fixed point algorithms for split feasibility problems. Fixed Point Theory. 2019;20(1):245–254.
   Web of Science ®Google Scholar
• Reich S, Tuyen TM, Trang NM. Parallel iterative methods for solving the split common fixed point problem in Hilbert spaces. Numer Func Anal Optim. 2020;41(7):778–805.
   Web of Science ®Google Scholar
• Reich S, Tuyen TM. Two projection algorithms for solving the split common fixed point problem. J Optim Theory Appl. 2020;186(1):148–168.
   Web of Science ®Google Scholar
• Byrne C. Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 2002;18(2):441.
   Web of Science ®Google Scholar
• Byrne C. A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 2003;20(1):103.
   Web of Science ®Google Scholar
• Censor Y, Elfving T. A multiprojection algorithm using Bregman projections in a product space. Numer Algorithms. 1994;8(2):221–239.
   Google Scholar
• Dang Y, Gao Y. The strong convergence of a KM–CQ-like algorithm for a split feasibility problem. Inverse Probl. 2010;27(1):015007.
   Web of Science ®Google Scholar
• Ansari QH, Rehan A. Split feasibility and fixed point problems. In: Ansari QH, editor. Nonlinear analysis. New Delhi: Springer.281–322.
   Google Scholar
• Xu HK. Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Probl. 2010;26(10):105018.
   Web of Science ®Google Scholar
• Yang Q. The relaxed CQ algorithm solving the split feasibility problem. Inverse Probl. 2004;20(4):1261.
   Web of Science ®Google Scholar
• Yang Q, Zhao J. Generalized KM theorems and their applications. Inverse Probl. 2006;22(3):833.
   Web of Science ®Google Scholar
• Dang Y, Sun J, Xu H. Inertial accelerated algorithms for solving a split feasibility problem. J Ind Manage Optim. 2017;13(3):1383–1394.
   Web of Science ®Google Scholar
• Gibali A, Liu LW, Tang YC. Note on the modified relaxation CQ algorithm for the split feasibility problem. Optim Lett. 2018;12(4):817–830.
   Web of Science ®Google Scholar
• López G, Martín-Márquez V, Wang F, et al. Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Probl. 2012;28(8):085004.
   Web of Science ®Google Scholar
• Jouymandi Z, Moradlou F. Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces. Math Methods Appl Sci. 2019;42(12):4343–4359.
   Web of Science ®Google Scholar
• Suantai S, Pholasa N, Cholamjiak P. The modified inertial relaxed CQ algorithm for solving the split feasibility problems. J Ind Manage Optim. 2018;14(4):1595.
   Web of Science ®Google Scholar
• Yu H, Zhan W, Wang F. The ball-relaxed CQ algorithms for the split feasibility problem. Optimization. 2018;67(10):1687–1699.
   Web of Science ®Google Scholar
• Yu X, Shahzad N, Yao Y. Implicit and explicit algorithms for solving the split feasibility problem. Optim Lett. 2012;6(7):1447–1462.
   Web of Science ®Google Scholar
• Qu B, Xiu N. A note on the CQ algorithm for the split feasibility problem. Inverse Probl. 2005;21(5):1655.
   Web of Science ®Google Scholar
• Zhao J, Yang Q. Several solution methods for the split feasibility problem. Inverse Probl. 2005;21(5):1791.
   Web of Science ®Google Scholar
• Wang F, Xu HK. Approximating curve and strong convergence of the CQ algorithm for the split feasibility problem. J Inequal Appl. 2010;2010:1–13.
   Web of Science ®Google Scholar
• Bauschke HH, Borwein JM. On projection algorithms for solving convex feasibility problems. SIAM Rev. 1996;38(3):367–426.
   Web of Science ®Google Scholar
• Fukushima M. A relaxed projection method for variational inequalities. Math Program. 1986;35(1):58–70.
   Web of Science ®Google Scholar
• He B. Inexact implicit methods for monotone general variational inequalities. Math Program. 1999;86(1):199–217.
   Web of Science ®Google Scholar
• Cegielski A. Iterative methods for fixed point problems in Hilbert spaces. Vol. 2057. Berlin: Springer; 2012.
   Google Scholar
• He S, Zhao Z. Strong convergence of a relaxed CQ algorithm for the split feasibility problem. J Inequal Appl. 2013;2013(1):197.
   Web of Science ®Google Scholar
• He H, Xu HK. Splitting methods for split feasibility problems with application to dantzig selectors. Inverse Probl. 2017;33(5):055003.
   Web of Science ®Google Scholar
• López G, Martín-Márquez V, Xu HK, et al. Iterative algorithms for the multiple-sets split feasibility problem. In: Censor Y, Jiang M, Wang G, editors. Biomedical mathematics: promising directions in imaging, therapy planning and inverse problems Madison: Medical Physics Publishing; 2010. p. 243–279.
   Google Scholar
• Zhao J, Yang Q. Self-adaptive projection methods for the multiple-sets split feasibility problem. Inverse Probl. 2011;27(3):035009.
   Web of Science ®Google Scholar
• Dang Yz, Yao J, Gao Y. Relaxed two points projection method for solving the multiple-sets split equality problem. Numer Algorithms. 2018;78(1):263–275.
   Web of Science ®Google Scholar
• Latif A, Vahidi J, Eslamian M. Strong convergence for generalized multiple-set split feasibility problem. Filomat. 2016;30(2):459–467.
   Web of Science ®Google Scholar
• Iyiola O, Shehu Y. A cyclic iterative method for solving multiple sets split feasibility problems in Banach spaces. Quaest Math. 2016;39(7):959–975.
   Web of Science ®Google Scholar
• Khan AR, Abbas M, Shehu Y. A general convergence theorem for multiple-set split feasibility problem in Hilbert spaces. Carpathian J Math. 2015;31:349–357.
   Web of Science ®Google Scholar
• Suantai S, Pholasa N, Cholamjiak P. Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems. Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales Serie A Matemáticas. 2019;113(2):1081–1099.
   Web of Science ®Google Scholar
• Wang J, Hu Y, Yu CKW, et al. A family of projection gradient methods for solving the multiple-sets split feasibility problem. J Optim Theory Appl. 2019;183(2):520–534.
   Web of Science ®Google Scholar
• Mewomo O, Ogbuisi F. Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces. Quaest Math. 2018;41(1):129–148.
   Web of Science ®Google Scholar
• Buong N, Hoai PTT, Binh KT. Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces. Acta Appl Math. 2020;165(1):183–197.
   Web of Science ®Google Scholar
• Yao Y, Postolache M, Zhu Z. Gradient methods with selection technique for the multiple-sets split feasibility problem. Optimization. 2019;69:269–281.
   Web of Science ®Google Scholar
• Kesornprom S, Pholasa N, Cholamjiak P. A modified CQ algorithm for solving the multiple-sets split feasibility problem and the fixed point problem for nonexpansive mappings. Thai J Math. 2019;17(2):475–493.
   Web of Science ®Google Scholar
• Wang X. Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems. J Inequal Appl. 2018;2018(1):1–8.
   PubMed Web of Science ®Google Scholar
• Taddele GH, Kumam P, Gebrie AG, et al. Half-space relaxation projection method for solving multiple-set split feasibility problem. Math Comput Appl. 2020;25(3):47.
   Web of Science ®Google Scholar
• Bauschke HH, Combettes PL. Convex analysis and monotone operator theory in Hilbert spaces. Vol. 408. New York: Springer; 2011.
   Google Scholar
• Xu HK. Averaged mappings and the gradient-projection algorithm. J Optim Theory Appl. 2011;150(2):360–378.
   Web of Science ®Google Scholar
• Aubin JP. Optima and equilibria: an introduction to nonlinear analysis. Vol. 140. Berlin: Springer Science & Business Media; 2013.
   Google Scholar
• Marino G, Xu HK. Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces. J Math Anal Appl. 2007;329(1):336–346.
   Web of Science ®Google Scholar
• Zegeye H, Shahzad N. Convergence of Mann's type iteration method for generalized asymptotically nonexpansive mappings. Comput Math Appl. 2011;62(11):4007–4014.
   Web of Science ®Google Scholar
• Suantai S, Eiamniran N, Pholasa N, et al. Three-step projective methods for solving the split feasibility problems. Mathematics. 2019;7(8):712.
   Web of Science ®Google Scholar
• Dai YH. Fast algorithms for projection on an ellipsoid. SIAM J Optim. 2006;16(4):986–1006.
   Web of Science ®Google Scholar