Smoothed Analysis of Interior-Point Algorithms: Condition Number

Abstract

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

Fixed it up quite a bit

Cited by in corpus (1)

• Smoothed Analysis of Interior-Point Algorithms: Termination