Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Smoothed analysis of condition numbers and complexity implications for linear programming |
scientific article; zbMATH DE number 5851422
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Smoothed analysis of condition numbers and complexity implications for linear programming |
scientific article; zbMATH DE number 5851422 |
Statements
Smoothed analysis of condition numbers and complexity implications for linear programming (English)
0 references
14 February 2011
0 references
The paper performs a smoothed analysis of Renegar's condition number for linear programming by analysing the distribution of the distance to ill-posedness of a linear program subject to a slight Gaussian perturbation. This analysis demonstrates that if there is a little bit of imprecision or noise in the input data, then the linear program is unlikely to be poorly conditioned, and hence can be solved quickly by interior-point algorithms.
0 references
linear programming
0 references
interior point algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
