An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02592088 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1498125507 / rank | |||
Normal rank | |||
Latest revision as of 09:04, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming |
scientific article |
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
