Linear Convergence of Projection Algorithms
arXiv:1609.00341 · doi:10.1287/moor.2018.0942
Abstract
Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we study linear convergence of several projection algorithms for systems of finitely many closed sets. The results complement contemporary research on the same topic.
References in corpus (7)
- Transversality and alternating projections for nonconvex sets
- Convergence rate analysis for averaged fixed point iterations in the presence of Hölder regularity
- A Cyclic Douglas-Rachford Iteration Scheme
- About subtransversality of collections of sets
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm
- The Douglas-Rachford algorithm in the affine-convex case
- On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces