Weak limits of consecutive projections and of greedy steps
Abstract
Let H be a Hilbert space. We investigate the properties of weak limit points of iterates of random projections onto K≥ 2 closed convex sets in H and the parallel properties of weak limit points of residuals of random greedy approximation with respect to K dictionaries. In the case of convex sets these properties imply weak convergence in all the cases known so far. In particular, we give a short proof of the theorem of Amemiya and Ando on weak convergence when the convex sets are subspaces. The question of the weak convergence in general remains open.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.