Extending Meshulam's result on the boundedness of orbits of relaxed projections onto affine subspaces from finite to infinite-dimensional Hilbert spaces
Heinz H. Bauschke, Tran Thanh Tung
TL;DR
The paper extends Meshulam's finite-dimensional boundedness result for sequences generated by random relaxed projections onto a finite collection of affine subspaces to general Hilbert spaces under the assumption of innate regularity of the parallel linear subspaces. The core method replaces Meshulam's dimension-based induction with an induction on the number of affine subspaces and employs contraction bounds derived from cycles of relaxed projections, together with a controlled translation term when affine translates are present. Key contributions include a finite bound $C_{\\mathcal{A},\\lambda}$ ensuring boundedness for fixed and varying relaxation parameters, connections to randomized block Kaczmarz methods, and a linear-convergence result for cyclic compositions. The work also discusses the necessity of innate regularity via limiting examples and touches on extensions to polyhedral sets and parameter-sequence behavior, providing a broader theoretical framework for projection-based algorithms in infinite-dimensional settings.
Abstract
In 1996, Meshulam proved that any sequence generated in Euclidean space by randomly projecting onto affine subspaces drawn from a finite collection stays bounded even if the intersection of the subspaces is empty. His proof, which works even for relaxed projections, relies on an ingenious induction on the dimension of the Euclidean space. In this paper, we extend Meshulam's result to the general Hilbert space setting by an induction proof of the number of affine subspaces in the given collection. We require that the corresponding parallel linear subspaces are innately regular -- this assumption always holds in Euclidean space. We also discuss the sharpness of our result and make a connection to randomized block Kaczmarz methods.
