✦ 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
DOI: 10.1007/s10107-003-0448-9

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

Robust smoothed analysis of a condition

Robust smoothed analysis of a condition number for linear programming

✍ Peter Bürgisser; Dennis Amelunxen 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 364 KB

Smoothed analysis of condition numbers a

Smoothed analysis of condition numbers and complexity implications for linear programming

✍ John Dunagan; Daniel A. Spielman; Shang-Hua Teng 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 345 KB

New algorithms for linear programming

✍ Shiquan Wu; Fang Wu 📂 Article 📅 1992 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 364 KB

Analysis of a smoothing method for symme

Analysis of a smoothing method for symmetric conic linear programming

✍ Yong-Jin Liu; Li-Wei Zhang; Yin-He Wang 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 228 KB

A note on finite termination of iterativ

A note on finite termination of iterative algorithms in mathematical programming

✍ 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