A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913): 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:35, 1 February 2024
scientific article
| 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 |
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
