On the complexity of linear programming under finite precision arithmetic (Q1380938): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:24, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of linear programming under finite precision arithmetic |
scientific article |
Statements
On the complexity of linear programming under finite precision arithmetic (English)
0 references
11 March 1998
0 references
interior point methods
0 references
error analysis
0 references
conditioning
0 references
finite precision arithmetic
0 references
computing error bounds
0 references
logarithmic barrier method
0 references
