A note on finite termination of iterativ
โ
Jinchuan Zhou; Changyu Wang
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 610 KB
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