String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases

Aleyner, A., Censor, Y.: Best approximation to common fixed points of a semigroup of nonexpansive operators. J. Nonlinear Convex Anal. 6, 137–151 (2005)

Artacho, F.J.A., Campoy, R.: A new projection method for finding the closest point in the intersection of convex sets. Comput. Optim. Appl. 69, 99–132 (2018)

Bargetz, C., Reich, S., Zalas, R.: Convergence properties of dynamic string-averaging projection methods in the presence of perturbations. Numer. Algorithms 77, 185–209 (2018)

Bauschke, H.H.: The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space. J. Math. Anal. Appl. 202, 150–159 (1996)

Bauschke, H.H., Borwein, J.M.: On the convergence of von Neumann’s alternating projection algorithm for two sets. Set-Valued Anal. 1, 185–212 (1993)

Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367–426 (1996)

Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Space, 2nd edn. Springer, Cham (2017)

Bauschke, H.H., Koch, V.R.: Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces. Contemp. Math. 636, 1–40 (2015)

Bregman, L.M., Censor, Y., Reich, S., Zepkowitz-Malachi, Y.: Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. J. Approx. Theory 124, 194–218 (2003)

Blat, D., Hero, A.O. III: Energy based sensor network source localization via projection onto convex sets (POCS). IEEE Trans. Signal Process. 54, 3614–3619 (2006)

Boyle, J.P., Dykstra, R.L.: A method for finding projections onto the intersection of convex sets in Hilbert spaces. In: Dykstra, R., Robertson, T., Wright, F.T. (eds.) Advances in Order Restricted Statistical Inference. Lecture Notes in Statistics, vol. 37, pp. 28–47. Springer, New York (1986)

Brooke, M., Censor, Y., Gibali, A.: Dynamic string-averaging CQ-methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning. Int. Trans. Oper. Res. (2020). https://doi.org/10.1111/itor.12929

Cegielski, A.: Iterative Methods for Fixed Point Problems in Hilbert Spaces. Springer, Berlin (2012)

Censor, Y.: Computational acceleration of projection algorithms for the linear best approximation problem. Linear Algebra Appl. 416, 111–123 (2006)

Censor, Y., Cegielski, A.: Projection methods: an annotated bibliography of books and reviews. Optimization 64, 2343–2358 (2015)

Censor, Y., Elfving, T., Herman, G.T.: Averaging strings of sequential iterations for convex feasibility problems. In: Butnariu, D., Censor, Y., Reich, S. (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, pp. 101–114. Elsevier, Amsterdam (2001)

Censor, Y., Segal, A.: On the string averaging method for sparse common fixed-point problems. Int. Trans. Oper. Res. 16, 481–494 (2009)

Censor, Y., Tom, E.: Convergence of string-averaging projection schemes for inconsistent convex feasibility problems. Optim. Methods Softw. 18, 543–554 (2003)

Censor, Y., Zaslavski, A.J.: Convergence and perturbation resilience of dynamic string-averaging projection methods. Comput. Optim. Appl. 54, 65–76 (2013)

Censor, Y., Zaslavski, A.J.: String-averaging projected subgradient methods for constrained minimization. Optim. Methods Softw. 29, 658–670 (2014)

Combettes, P.L.: Construction d’un point fixe commun à une famille de contractions fermes. C. R. Acad. Sci. Paris, Sér. A Math. 320, 1385–1390 (1995)

Crombez, G.: Finding common fixed points of strict paracontractions by averaging strings of sequential iterations. J. Nonlinear Convex Anal. 3, 345–351 (2002)

Deutsch, F.: Rate of convergence of the method of alternating projections. In: Brosowski, B., Deutsch, F. (eds.) Parametric Optimization and Approximation. International Series of Numerical Mathematics, vol. 72, pp. 96–107. Birkhäuser, Basel (1984)

Deutsch, F.: Best Approximation in Inner Product Spaces. Springer, New York (2001)

Deutsch, F., Hundal, H.: The rate of convergence for the method of alternating projections II. J. Math. Anal. Appl. 205, 381–405 (1997)

Deutsch, F., Yamada, I.: Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings. Numer. Funct. Anal. Optim. 19, 33–56 (1998)

Dye, J., Khamsi, M.A., Reich, S.: Random products of contractions in Banach spaces. Trans. Am. Math. Soc. 325, 87–99 (1991)

Dykstra, R.L.: An algorithm for restricted least squares regression. J. Am. Stat. Assoc. 78, 837–842 (1983)

Halpern, B.: Fixed points of nonexpanding maps. Bull. Am. Math. Soc. 73, 957–961 (1967)

Kong, T.Y., Pajoohesh, H., Herman, G.T.: String-averaging algorithms for convex feasibility with infinitely many sets. Inverse Probl. 35, 045011 (2019)

Kopecká, E., Reich, S.: A note on the von Neumann alternating projections algorithm. J. Nonlinear Convex Anal. 5, 379–386 (2004)

López, G., Martin-Márquez, V., Xu, H.: Halpern’s iteration for nonexpansive mappings. Contemp. Math. 513, 211–231 (2010)

Reich, S., Zalas, R.: A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space. Numer. Algorithms 72, 297–323 (2016)

von Neumann, J.: Functional Operators II: The Geometry of Orthogonal Spaces. Princeton University Press, Princeton (1950). Reprint of mimeographed lecture notes first distributed in 1933

Wittman, R.: Approximation of fixed points of nonexpansive mappings. Arch. Math. 58, 486–491 (1992)