科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
