An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092)
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: An O( n L) iteration bound primal-dual cone affine scaling algorithm for linear programming |
scientific article; zbMATH DE number 912379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming |
scientific article; zbMATH DE number 912379 |
Statements
An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (English)
0 references
17 October 1996
0 references
primal-dual interior point algorithm
0 references
polynomiality
0 references
primal-dual affine scaling method
0 references
primal-dual central path
0 references
0 references
0 references
0 references
0.93780977
0 references
0.9150746
0 references
0.91460556
0 references
0.91160476
0 references
0.9092504
0 references
0.9039729
0 references
0.90079474
0 references
