Smoothed Analysis of Interior-Point Algorithms: Condition Number
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2003
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912655094054912 |
|---|---|
| author | Dunagan, John Spielman, Daniel A. Teng, Shang-Hua |
| author_facet | Dunagan, John Spielman, Daniel A. Teng, Shang-Hua |
| contents | We show that the smoothed complexity of the logarithm of Renegar's condition number is O(log (n/sigma)). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_cs_0302011 |
| institution | arXiv |
| publishDate | 2003 |
| record_format | arxiv |
| spellingShingle | Smoothed Analysis of Interior-Point Algorithms: Condition Number Dunagan, John Spielman, Daniel A. Teng, Shang-Hua Data Structures and Algorithms Numerical Analysis F.2.1; G.1.6 We show that the smoothed complexity of the logarithm of Renegar's condition number is O(log (n/sigma)). |
| title | Smoothed Analysis of Interior-Point Algorithms: Condition Number |
| topic | Data Structures and Algorithms Numerical Analysis F.2.1; G.1.6 |
| url | https://arxiv.org/abs/cs/0302011 |