Convergence of remote projections onto convex sets
Petr A. Borodin, Eva Kopeck\'a

TL;DR
This paper investigates the convergence of sequences generated by remote projections onto convex sets in a Hilbert space, establishing necessary and sufficient conditions for norm and weak convergence based on the properties of the sets and the parameters controlling the projections.
Contribution
It introduces a new convergence condition (T) for remote projections, generalizing previous results and clarifying the role of symmetry and the parameters in convergence behavior.
Findings
Condition (T) is necessary and sufficient for norm convergence.
Sum of squared parameters diverging ensures weak convergence.
Examples show symmetry can be relaxed under certain conditions.
Abstract
Let be a family of closed and convex sets in a Hilbert space , having a nonempty intersection . We consider a sequence of remote projections onto them. This means, , and is the projection of onto such a set that the ratio of the distances from to this set and to any other set from the family is at least . We study properties of the weakness parameters and of the sets which ensure the norm or weak convergence of the sequence to a point in . We show that condition (T) is necessary and sufficient for the norm convergence of to a point in for any starting element and any family of closed, convex, and symmetric sets . This generalizes a result of Temlyakov who introduced (T) in the context of greedy approximation theory. We give…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Approximation Theory and Sequence Spaces · Advanced Banach Space Theory
