| Article ID: | iaor20102906 |
| Volume: | 36 |
| Issue: | 6 |
| Start Page Number: | 715 |
| End Page Number: | 717 |
| Publication Date: | Nov 2008 |
| Journal: | Operations Research Letters |
| Authors: | Wang Changyu, Zhou Jinchuan |
Two well-known results on the unified treatment of finite termination of a class of algorithms for solving convex programming problems and for solving variational inequality problems are reconsidered. In particular, some of the underlying assumptions employed in the existing literature are shown to be redundant.