Smoothed analysis of condition numbers and complexity implications for linear programming

We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to a slight Gaussian perturbation. In particular, we show that for every n -by- d matrix Ā, n -vector , and d -vector satisfy...

Ausführliche Beschreibung