Abstract
Assuming that the absence of perturbations guarantees weak or strong convergence to a common fixed point, we study the behavior of perturbed products of an infinite family of nonexpansive operators. Our main result indicates that the convergence rate of unperturbed products is essentially preserved in the presence of perturbations. This, in particular, applies to the linear convergence rate of dynamic string-averaging projection methods, which we establish here as well. Moreover, we show how this result can be applied to the superiorization methodology.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Aleyner, A., Reich, S.: Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces. J. Math. Anal. Appl. 343(1), 427–435 (2008)
Aronszajn, N.: Theory of reproducing kernels. Trans. Amer. Math. Soc. 68, 337–404 (1950)
Badea, C., Grivaux, S., Müller, V.: The rate of convergence in the method of alternating projections. Algebra i Analiz 23(3), 1–30 (2011)
Bauschke, H.H.: Projection algorithms: results and open problems Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (Haifa, 2000), Stud. Comput. Math., vol. 8, pp 11–22. North-Holland, Amsterdam (2001)
Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38(3), 367–426 (1996)
Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics/Ouvrages De Mathématiques De La SMC. Springer, New York (2011). With a foreword by Hédy Attouch
Bauschke, H.H., Noll, D., Phan, H.M.: Linear and strong convergence of algorithms involving averaged nonexpansive operators. J. Math. Anal. Appl. 421(1), 1–20 (2015)
Beck, A., Teboulle, M.: Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems. Optim. Methods Softw. 18(4), 377–394 (2003). The Second Japanese-Sino Optimization Meeting, Part II (Kyoto, 2002)
Borwein, J.M., Li, G., Tam, M.K.: Convergence rate analysis for averaged fixed point iterations in common fixed point problems. SIAM J. Optim. 27(1), 1–33 (2017)
Butnariu, D., Davidi, R., Herman, G.T., Kazantsev, I.G.: Stable convergence behavior under summable perturbations of a class of projection methods for convex feasibility and optimization problems. IEEE J. Selected Topics Signal Process. 1(4), 540–547 (2007)
Butnariu, D., Reich, S., Zaslavski, A.J.: Convergence to fixed points of inexact orbits of Bregman-monotone and of nonexpansive operators in Banach spaces Fixed Point Theory and Its Applications, pp 11–32. Yokohama Publ., Yokohama (2006)
Butnariu, D., Reich, S., Zaslavski, A.J.: Stable convergence theorems for infinite products and powers of nonexpansive mappings. Numer. Funct. Anal. Optim. 29(3–4), 304–323 (2008)
Cegielski, A.: Iterative Methods for Fixed Point Problems in Hilbert Spaces. Lecture Notes in Mathematics, vol. 2057. Springer, Heidelberg (2012)
Cegielski, A., Zalas, R.: Properties of a class of approximately shrinking operators and their applications. Fixed Point Theory 15(2), 399–426 (2014)
Censor, Y.:Weak and strong superiorization: between feasibility-seeking and minimization. An. Ştiinţ. Univ. “Ovidius” Constanţa Ser. Mat. 23(3), 41–54 (2015)
Censor, Y., Davidi, R., Herman, G.T.: Perturbation resilience and superiorization of iterative algorithms. Inverse Probl 26(6), 065,008 (2010). 12 pages
Censor, Y., Davidi, R., Herman, G.T., Schulte, R.W., Tetruashvili, L.: Projected subgradient minimization versus superiorization. J. Optim. Theory Appl. 160(3), 730–747 (2014)
Censor, Y., Elfving, T., Herman, G.T.: Averaging strings of sequential iterations for convex feasibility problems Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (Haifa, 2000), Stud. Comput. Math., vol. 8, pp 101–113. North-Holland, Amsterdam (2001)
Censor, Y., Zaslavski, A.J.: Convergence and perturbation resilience of dynamic string-averaging projection methods. Comput. Optim. Appl. 54(1), 65–76 (2013)
Censor, Y., Zaslavski, A.J.: Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods. J. Optim. Theory Appl. 165(1), 172–187 (2015)
Combettes, P.L.: On the numerical robustness of the parallel projection method in signal synthesis. IEEE Signal Process. Lett. 8(2), 45–47 (2001)
Combettes, P.L.: Quasi-Fejérian analysis of some optimization algorithms, vol. 8, North-Holland (2001)
Combettes, P.L.: Solving monotone inclusions via compositions of nonexpansive averaged operators. Optimization 53(5–6), 475–504 (2004)
Combettes, P.L., Yamada, I.: Compositions and convex combinations of averaged nonexpansive operators. J. Math. Anal. Appl. 425(1), 55–70 (2015)
Deutsch, F., Hundal, H.: The rate of convergence for the cyclic projections algorithm. I. Angles between convex sets. J. Approx. Theory 142(1), 36–55 (2006)
Deutsch, F., Hundal, H.: The rate of convergence for the cyclic projections algorithm. II. Norms of nonlinear operators. J. Approx. Theory 142(1), 56–82 (2006)
Deutsch, F., Hundal, H.: The rate of convergence for the cyclic projections algorithm. III. Regularity of convex sets. J. Approx. Theory 155(2), 155–184 (2008)
Garduño, E., Herman, G.T., Davidi, R.: Reconstruction from a few projections by ℓ 1-minimization of the Haar transform. Inverse Problems 27(5), 055,006 (2011). 13 pages
Goebel, K., Reich, S.: Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings Monographs and Textbooks in Pure and Applied Mathematics, vol. 83. Marcel Dekker, Inc., New York (1984)
Gurin, L.G., Poljak, B.T., Raı̆k, E.V.: Projection methods for finding a common point of convex sets. Z. Vycisl. Mat. i Mat. Fiz. 7, 1211–1228 (1967)
Herman, G.T.: Fundamentals of Computerized Tomography: Image Reconstruction from Projections, 2nd edn. Springer (2009)
Herman, G.T., Davidi, R.: Image reconstruction from a small number of projections. Inverse Problems 24(4), 045011 (2008). 17 pages
Kayalar, S., Weinert, H.L.: Error bounds for the method of alternating projections. Math. Control Signals Syst. 1(1), 43–59 (1988)
Kolobov, V.I., Reich, S., Zalas, R.: Weak, strong and linear convergence of a double-layer fixed point algorithm. Accepted for publication in the SIAM J. Optim (2017)
Nevanlinna, O., Reich, S.: Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces. Israel J. Math. 32(1), 44–58 (1979)
Pierra, G.: Decomposition through formalization in a product space. Math. Program. 28(1), 96–115 (1984)
Pustylnik, E., Reich, S., Zaslavski, A.J.: Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space. J. Approx. Theory 164(5), 611–624 (2012)
Pustylnik, E., Reich, S., Zaslavski, A.J.: Inner inclination of subspaces and infinite products of orthogonal projections. J. Nonlin. Convex Anal. 14(3), 423–436 (2013)
Reich, S., Zalas, R.: A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space. Numer. Algor. 72(2), 297–323 (2016)
Reich, S., Zaslavski, A.J.: An example concerning bounded linear regularity of subspaces in Hilbert space. Bull. Aust. Math. Soc. 89(2), 217–226 (2014)
Reich, S., Zaslavski, A.J.: Porosity and the bounded linear regularity property. J. Appl. Anal. 20(1), 1–6 (2014)
Sidky, E.Y., Pan, X.: Image reconstruction in circular cone-beam computed tomography by constrained, total-variation minimization. Phys. Med. Biol. 53(17), 4777–4807 (2008)
Acknowledgments
Open access funding provided by University of Innsbruck and Medical University of Innsbruck. The authors are grateful to the anonymous referees for all their comments and remarks which helped improve this paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Bargetz, C., Reich, S. & Zalas, R. Convergence properties of dynamic string-averaging projection methods in the presence of perturbations. Numer Algor 77, 185–209 (2018). https://doi.org/10.1007/s11075-017-0310-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-017-0310-4