𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Smoothed analysis of termination of linear programming algorithms

✍ Scribed by Daniel A. Spielman; Shang-Hua Teng


Publisher
Springer-Verlag
Year
2003
Tongue
English
Weight
291 KB
Volume
97
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Smoothed analysis of integer programming
✍ Heiko RΓΆglin; Berthold VΓΆcking πŸ“‚ Article πŸ“… 2007 πŸ› Springer-Verlag 🌐 English βš– 467 KB
New algorithms for linear programming
✍ Shiquan Wu; Fang Wu πŸ“‚ Article πŸ“… 1992 πŸ› Institute of Applied Mathematics, Chinese Academy 🌐 English βš– 364 KB
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