Smoothed Analysis of Interior-Point Algorithms: Condition Number
Data Structures and Algorithms
2025-10-20 v2 Numerical Analysis
Numerical Analysis
Abstract
We show that the smoothed complexity of the logarithm of Renegar's condition number is O(log (n/sigma)).
Cite
@article{arxiv.cs/0302011,
title = {Smoothed Analysis of Interior-Point Algorithms: Condition Number},
author = {John Dunagan and Daniel A. Spielman and Shang-Hua Teng},
journal= {arXiv preprint arXiv:cs/0302011},
year = {2025}
}
Comments
Fixed it up quite a bit