New complexity analysis of a full Nesterov-Todd steps IIPM for semidefinite optimization (Q648491)
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: New complexity analysis of a full Nesterov-Todd steps IIPM for semidefinite optimization |
scientific article; zbMATH DE number 5976623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New complexity analysis of a full Nesterov-Todd steps IIPM for semidefinite optimization |
scientific article; zbMATH DE number 5976623 |
Statements
New complexity analysis of a full Nesterov-Todd steps IIPM for semidefinite optimization (English)
0 references
22 November 2011
0 references
infeasible interior-point method
0 references
primal-dual method
0 references
polynomial complexity
0 references
0.9000358581542969
0 references
0.8854033946990967
0 references
0.868135929107666
0 references
0.8660061955451965
0 references
0.8652613162994385
0 references
