Polynomial primal-dual affine scaling algorithms in semidefinite programming (Q1386485): 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:57, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial primal-dual affine scaling algorithms in semidefinite programming |
scientific article |
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
