Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model (Q3169071): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2108976672 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:37, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model |
scientific article |
Statements
Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model (English)
0 references
27 April 2011
0 references
convex optimization
0 references
ellipsoid algorithm
0 references
computational complexity
0 references
