Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model (Q3169071)

From MaRDI portal
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
    0 references
    0 references
    27 April 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    convex optimization
    0 references
    ellipsoid algorithm
    0 references
    computational complexity
    0 references
    0 references