Local Linear Convergence of Approximate Projections onto Regularized Sets
D. Russell Luke

TL;DR
This paper analyzes the local linear convergence of approximate projection algorithms onto regularized sets, providing a theoretical foundation and stopping criteria, with applications to phase retrieval in imaging.
Contribution
It introduces a regularization strategy to ensure regularity of set intersections and proves linear convergence of approximate projections, applicable to inverse problems.
Findings
Regularization improves intersection regularity and convergence.
Approximate projections achieve linear convergence under regularization.
The method is validated on phase retrieval with experimental data.
Abstract
The numerical properties of algorithms for finding the intersection of sets depend to some extent on the regularity of the sets, but even more importantly on the regularity of the intersection. The alternating projection algorithm of von Neumann has been shown to converge locally at a linear rate dependent on the regularity modulus of the intersection. In many applications, however, the sets in question come from inexact measurements that are matched to idealized models. It is unlikely that any such problems in applications will enjoy metrically regular intersection, let alone set intersection. We explore a regularization strategy that generates an intersection with the desired regularity properties. The regularization, however, can lead to a significant increase in computational complexity. In a further refinement, we investigate and prove linear convergence of an approximate…
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.
