A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913)
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: A lower bound on the number of iterations of long-step primal-dual linear programming algorithms |
scientific article; zbMATH DE number 894985
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on the number of iterations of long-step primal-dual linear programming algorithms |
scientific article; zbMATH DE number 894985 |
Statements
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (English)
0 references
1 July 1996
0 references
interior-point algorithms
0 references
primal-dual affine-scaling method
0 references
duality gap
0 references
lower bound
0 references
polynomiality
0 references
path-following
0 references
0 references
0 references
0 references
0 references
0 references
0.9112389
0 references
0.8892884
0 references
0.8879742
0 references
0 references
0 references
0.8839635
0 references
0.8831669
0 references
