ON THE COMPLEXITY OF APPROXIMATING THE MAXIMAL INSCRIBED ELLIPSOID FOR A POLYTOPE

Authors
KHACHIYAN LG TODD MJ
Citation
Lg. Khachiyan et Mj. Todd, ON THE COMPLEXITY OF APPROXIMATING THE MAXIMAL INSCRIBED ELLIPSOID FOR A POLYTOPE, Mathematical programming, 61(2), 1993, pp. 137-159
Citations number
14
Categorie Soggetti
Operatione Research & Management Science",Mathematics,"Operatione Research & Management Science",Mathematics,"Computer Applications & Cybernetics
Journal title
Mathematical programming → ACNP
ISSN journal
00255610
Volume
61
Issue
2
Year of publication
1993
Pages
137 - 159
Database
ISI
SICI code
0025-5610(1993)61:2<137:OTCOAT>2.0.ZU;2-I
Abstract
We give a new polynomial bound on the complexity of approximating the maximal inscribed ellipsoid for a polytope.