A note on finite termination of iterative algorithms in mathematical programming

✍ Scribed by Jinchuan Zhou; Changyu Wang

• Publisher: Elsevier Science
• Year: 2008
• Tongue: English
• Weight: 610 KB
• Volume: 36
• Category: Article
• ISSN: 0167-6377
• DOI: 10.1016/j.orl.2008.07.005

✦ Synopsis

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.