Abstract
The method of alternating projections involves projecting an element of a Hilbert space cyclically onto a collection of closed subspaces. It is known that the resulting sequence always converges in norm and that one can obtain estimates for the rate of convergence in terms of quantities describing the geometric relationship between the subspaces in question, namely their pairwise Friedrichs numbers. We consider the question of how best to order a given collection of subspaces so as to obtain the best estimate on the rate of convergence. We prove, by relating the ordering problem to a variant of the famous Travelling Salesman Problem, that correctness of a natural form of the Greedy Algorithm would imply that \(\mathrm {P}=\mathrm {NP}\), before presenting a simple example which shows that, contrary to a claim made in the influential paper (Kayalar and Weinert in Math Control Signals Syst 1(1):43–59, 1988), the result of the Greedy Algorithm is not in general optimal. We go on to establish sharp estimates on the degree to which the result of the Greedy Algorithm can differ from the optimal result. Underlying all of these results is a construction which shows that for any matrix whose entries satisfy certain natural assumptions it is possible to construct a Hilbert space and a collection of closed subspaces such that the pairwise Friedrichs numbers between the subspaces are given precisely by the entries of that matrix.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Badea, C., Grivaux, S., Müller, V.: The rate of convergence in the method of alternating projections. Algebra i Analiz (St. Petersburg Math. J.) 23(3), 1–30 (2011)
Badea, C., Seifert, D.: Ritt operators and convergence in the method of alternating projections. J. Approx. Theory 205, 133–148 (2016)
Deutsch, F.: The method of alternating orthogonal projections. In: Approximation Theory, Spline Functions and Applications (Maratea, 1991), volume 356 of NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., pp. 105–121. Kluwer Acad. Publ., Dordrecht (1992)
Deutsch, F.: Best Approximation in Inner Product Spaces. CMS Books in Mathematics. Springer, New York (2001)
Deutsch, F., Hundal, H.: The rate of convergence in the method of alternating projections, II. J. Math. Anal. Appl. 205, 381–405 (1997)
Deutsch, F., Hundal, H.: Slow convergence of sequences of linear operators II: arbitrarily slow convergence. J. Approx. Theory 162(9), 1717–1738 (2010)
Deutsch, F., Hundal, H.: Arbitarily slow convergence of sequences of linear operators. In: Infinite Products of Operators and Their Applications, volume 636 of Contemp. Math., pp. 93–120. Amer. Math. Soc., Providence, RI (2015)
Halperin, I.: The product of projection operators. Acta Sci. Math. (Szeged) 23, 96–99 (1962)
Kayalar, S., Weinert, H.L.: Error bounds for the method of alternating projections. Math. Control Signals Syst. 1(1), 43–59 (1988)
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
Darwin, O., Jha, A., Roy, S. et al. Non-optimality of the Greedy Algorithm for Subspace Orderings in the Method of Alternating Projections. Results Math 72, 979–990 (2017). https://doi.org/10.1007/s00025-017-0721-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00025-017-0721-5