On the Turing model complexity of interior point methods for semidefinite programming (Q2821802)
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: On the Turing model complexity of interior point methods for semidefinite programming |
scientific article; zbMATH DE number 6629377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Turing model complexity of interior point methods for semidefinite programming |
scientific article; zbMATH DE number 6629377 |
Statements
23 September 2016
0 references
semidefinite programming
0 references
interior point method
0 references
Turing model complexity
0 references
ellipsoid method
0 references
0 references
0 references
0.9137134
0 references
0.90934813
0 references
0.9060534
0 references
0.90322053
0 references
0.90319777
0 references
0.90182555
0 references
0.89995503
0 references
0.89890957
0 references
On the Turing model complexity of interior point methods for semidefinite programming (English)
0 references
