Transversality and alternating projections for nonconvex sets
Not on the map. Why?
Abstract (arXiv)
We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear convergence. When the two sets are semi-algebraic and bounded, but not necessarily transversal, we nonetheless prove subsequence convergence.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 29 Jan 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
3 papers.
- 2022Provable Phase Retrieval with Mirror Descentcited by 2
- 2025Linear Convergence of the Frank-Wolfe Algorithm over Product Polytopescited by 0
- 2026Optimization over the intersection of manifoldscited by 0
- 2026Optimization over the intersection of manifolds21 May 2026
- 2025Linear Convergence of the Frank-Wolfe Algorithm over Product Polytopes16 May 2025
- 2022Provable Phase Retrieval with Mirror Descent17 Oct 2022