Linear Convergence of Projection Algorithms

Published Online:https://doi.org/10.1287/moor.2018.0942

Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice owing 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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.