| Article ID: | iaor2013138 |
| Volume: | 54 |
| Issue: | 1 |
| Start Page Number: | 77 |
| End Page Number: | 91 |
| Publication Date: | Jan 2013 |
| Journal: | Computational Optimization and Applications |
| Authors: | Nikazad Touraj, Abbasi Mokhtar |
| Keywords: | programming: convex |
An algorithm for solving convex feasibility problem for a finite family of convex sets is considered. The acceleration scheme of De Pierro (1981), which is designed for simultaneous algorithms, is used in the algorithm to speed up the fully sequential cyclic subgradient projections method. A convergence proof is presented. The advantage of using this strategy is demonstrated with some examples.