Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10107-009-0278-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2136487406 / rank | |||
Normal rank |
Revision as of 21:56, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Smoothed analysis of condition numbers and complexity implications for linear programming |
scientific article |
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