✦ LIBER ✦

Smoothed analysis of condition numbers and complexity implications for linear programming

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

Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 345 KB
Volume: 126
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-009-0278-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 some condition numb

Smoothed analysis of some condition numbers

✍ F. Cucker; H. Diao; Y. Wei 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

Smoothed analysis of complex conic condi

Smoothed analysis of complex conic condition numbers

✍ Peter Bürgisser; Felipe Cucker; Martin Lotz 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 223 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

Characterizations, bounds, and probabili

Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems

✍ Michael J. Todd; Levent Tunçel; Yinyu Ye 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 91 KB

Complexity analysis of logarithmic barri

Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming

✍ Zhi-Quan Luo; C. Roos; T. Terlaky 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 816 KB

In this paper, we analyze a logarithmic barrier decomposition method for solving a semi-infinite linear programming problem. This method is in some respects similar to the column generation methods using analytic centers. Although the method was found to be very efficient in the recent computational