References
- Byrne Ch, Moudafi A. Extensions of the CQ algorithms for the split feasibility and split equality problems. Working paper UAG 2013-01.
- Moudafi A. Alternating CQ-algorithms for convex feasibility and split fixed-point problems. J. Nonlinear Convex Anal. 2014;15:809–818.
- Moudafi A. A relaxed alternating CQ-algorithms for convex feasibility problems. Nonlinear Anal. 2013;79:117–121.
- Attouch H, Bolte J, Redont P, Soubeyran A. Alternating proximal algorithms for weakly coupled minimization problems. Applications to dynamical games and PDEs. J. Convex Anal. 2008;15:485–506.
- Censor Y, Elfving T. A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms. 1994;8:221–239.
- Byrne Ch. A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Prob. 2004;20:103–120.
- Stark H, editor. Image recovery: theory and applications. San Diego (CA): Academic Press; 1987.
- Censor Y, Bortfeld T, Martin B, Trofimov A. A unified approach for inversion problems in intensity-modulated radiation therapy. Phys. Med. Biol. 2003;51:2353–2365.
- Byrne Ch. Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Prob. 2002;18:441–453.
- Bauschke HH, Borwein JM. On projection algorithms for solving convex feasibility problems. SIAM Rev. 1996;38:367–426.
- López G, Martín-Márquez V, Xu HK. 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 (WI): Medical Physics; 2009. p. 243-279.
- Moudafi A. A note on the split common fixed-point problem for quasi-nonexpansive operators. Nonlinear Anal. 2011;74:4083–4087.
- López G, Martín-Márquez V, Wang F, Xu HK. Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Prob. 2012;28:085004 (18pp). doi:10.1088/0266-5611/28/8/085004.
- Moudafi A, Al-Shemas E. Simultaneous iterative methods for split equality problems. Trans. Math. Program. Appl. 2013;1:1–11.
- Yang Q. On variable-step relaxed projection algorithm for variational inequalities. J. Math. Anal. Appl. 2005;302:166–179.
- Polyak BT. Introduction to optimization. New York (NY): Optimization Software; 1987.
- Xu HK. Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Prob. 2010;26:105018 (17pp).
- Yang Q. The relaxed CQ algorithm for solving the split feasibility problem. Inverse Prob. 2004;20:1261–1266.
- Halpern B. Fixed points of nonexpanding maps. Bull. Am. Math. Soc. 1967;73:591–597.
- Chen R, Li J, Ren Y. Regularization method for the approximate split equality problem in infinite-dimensional Hilbert spaces. Abstr. Appl. Anal. 2013; ID 813635: 5 pages.
- Dong Q-L, He S, Zhao J. Solving the split equality problem without prior knowledge of operator norms. Optimization. 2014. doi:10.1080/02331934.2014.895897.
- He S, Yang C. Solving the variational inequality problem defined on intersection of finite level sets. Abstr. Appl. Anal. 2013; Article ID 942315.
- Xu HK. Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 2002;66:240–256.
- Konnov IV. Equilibrium models and variational inequalities. Amsterdam: Elsevier; 2007.
- Fukushima M. A relaxed projection method for variational inequalities. Math. Program. 1986;35:58–70.
- Wittmann R. Approximation of fixed points of nonexpansive mappings. Arch. Math. 1992;58:486–491.
- Suzuki T. A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings. Proc. Am. Math. Soc. 2007;135:99–106.
- He S, Zhao Z. Strong convergence of a relaxed CQ algorithm for the split feasibility problem. J. Inequal. Appl. 2013;2013:197 (11pp). doi:10.1186/1029-242X-2013-197.