Polynomial primal-dual affine scaling algorithms in semidefinite programming (Q1386485)
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: Polynomial primal-dual affine scaling algorithms in semidefinite programming |
scientific article; zbMATH DE number 1154642
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial primal-dual affine scaling algorithms in semidefinite programming |
scientific article; zbMATH DE number 1154642 |
Statements
Polynomial primal-dual affine scaling algorithms in semidefinite programming (English)
0 references
5 May 1999
0 references
interior-point method
0 references
primal-dual method
0 references
Dikin steps
0 references
primal-dual affine scaling algorithms
0 references
semidefinite programming
0 references
worst-case complexity bound
0 references
0.8687904477119446
0 references
0.8575676679611206
0 references
0.857349157333374
0 references
0.8558514714241028
0 references
