A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913): Difference between revisions
From MaRDI portal
Latest revision as of 12:55, 24 May 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
0 references
0 references
0 references
0 references
0 references