References
- Byrne, C, 2002. Iterative oblique projection onto convex sets and the split feasibility problem, Inverse Probl. 18 (2002), pp. 441–453.
- Byrne, C, 2004. A unified treatment of some iterative algorithms in signal processing and image reconstruction, Inverse Probl. 20 (2004), pp. 103–120.
- Censor, Y, and Elfving, T, 1994. A multiprojection algorithm using Bregman projections in a product space, Numer. Algor. 8 (1994), pp. 221–239.
- Censor, Y, Elfving, T, Kopf, N, and Bortfeld, T, 2005. The multiple-sets split feasibility problem and its applications for inverse problems, Inverse Probl. 21 (2005), pp. 2071–2084.
- Zhang, W, Han, D, and Li, Z, 2009. A self-adaptive projection method for solving the multiple-sets split feasibility problem, Inverse Probl. 25 (2009), p. 115001.
- Zhao, J, and Yang, Q, 2011. Self-adaptive projection methods for the multiple-sets split feasibility problem, Inverse Probl. 27 (2011), p. 035009.
- Qu, B, and Xiu, N, 2005. A note on the CQ algorithm for the split feasibility problem, Inverse Probl. 21 (2005), pp. 1655–1665.
- Echebest, N, Guardarucci, MT, Scolnik, H, and Vacchino, MC, 2004. An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms, Numer. Algor. 35 (2004), pp. 331–350.
- Zarantonello, EH, 1971. "Projections on convex sets in Hilbert space and spectral theory". In: Zarantonello, EH, ed. Contributions to Nonlinear Functional Analysis. Vol. 20. New York: Academic Press; 1971.
- Yang, Q, 2004. The relaxed CQ algorithm solving the split feasibility problem, Inverse Probl. 20 (2004), pp. 1261–1266.
- Rockafellar, RT, 1970. Convex Analysis. Princeton, NJ: Princeton University Press; 1970.