On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (Q2821802): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1639981145 / rank | |||
Normal rank | |||
Latest revision as of 09:38, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming |
scientific article |
Statements
On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (English)
0 references
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
