Smoothed Analysis of Interior-Point Algorithms: Condition Number
We show that the smoothed complexity of the logarithm of Renegar's condition number is O(log (n/sigma)).
cs.DS↗
arXiv subjects
John Dunagan
Publications and source records attributed to John Dunagan.