On the complexity of approximating the maximal inscribed ellipsoid for a polytope (Q1315411): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Algorithm for Separating Patterns by Ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3276750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of four polyhedral set containment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5791470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal design: Some geometrical aspects of D-optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Potential Reduction Algorithm Allowing Column Generation / rank
 
Normal rank

Revision as of 12:18, 22 May 2024

scientific article
Language Label Description Also known as
English
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
scientific article

    Statements

    On the complexity of approximating the maximal inscribed ellipsoid for a polytope (English)
    0 references
    0 references
    0 references
    10 March 1994
    0 references
    path-following Newton's method
    0 references
    polynomial bound
    0 references
    maximal inscribed ellipsoid
    0 references
    polytope
    0 references

    Identifiers