On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- 1 August 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 61 (1-3) , 137-159
- https://doi.org/10.1007/bf01582144
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Potential Reduction Algorithm Allowing Column GenerationSIAM Journal on Optimization, 1992
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- On the complexity of four polyhedral set containment problemsMathematical Programming, 1985
- An Algorithm for Separating Patterns by EllipsoidsIBM Journal of Research and Development, 1982
- Optimal design: Some geometrical aspects of D-optimalityBiometrika, 1975
- InequalitiesPublished by Springer Nature ,1961
- Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen EllipsoidenArchiv der Mathematik, 1957