most citedSmoothed Analysis of Interior-Point Algorithms: Condition Number

4 citations · 4 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2003★ 4 cited

Smoothed Analysis of Interior-Point Algorithms: Condition Number

John Dunagan, Daniel A. Spielman, Shang-Hua Teng

We show that the smoothed complexity of the logarithm of Renegar's condition number is O(log (n/sigma)).