On the complexity of approximating the maximal inscribed ellipsoid for a polytope (Q1315411)
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 complexity of approximating the maximal inscribed ellipsoid for a polytope |
scientific article; zbMATH DE number 513275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of approximating the maximal inscribed ellipsoid for a polytope |
scientific article; zbMATH DE number 513275 |
Statements
On the complexity of approximating the maximal inscribed ellipsoid for a polytope (English)
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
0 references
0.9304316
0 references
0.9031893
0 references
0.89442855
0 references
0.8917137
0 references
0.8851594
0 references
0.8851594
0 references
0.8851366
0 references
0.8851366
0 references
0.8840582
0 references
