{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T19:29:02Z","timestamp":1769196542589,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1007\/bf01582144","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:39:20Z","timestamp":1114677560000},"page":"137-159","source":"Crossref","is-referenced-by-count":102,"title":["On the complexity of approximating the maximal inscribed ellipsoid for a polytope"],"prefix":"10.1007","volume":"61","author":[{"given":"Leonid G.","family":"Khachiyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Todd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1147\/rd.266.0759","volume":"26","author":"E.R. Barnes","year":"1982","unstructured":"E.R. Barnes, \u201cAn algorithm for separating patterns by ellipsoids,\u201dIBM Journal of Research and Development 26 (1982) 759\u2013764.","journal-title":"IBM Journal of Research and Development"},{"key":"CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-64971-4","volume-title":"Inequalities","author":"E.F. Beckenbach","year":"1961","unstructured":"E.F. Beckenbach and R. Bellman,Inequalities (Springer, Berlin, 1961)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/BF01899996","volume":"8","author":"L. Danzer","year":"1957","unstructured":"L. Danzer, D. Laugwitz and H. Lenz, \u201cUber das Lownersche Ellipsoid und sein Analogen unter den einem Eikorper einbeschriebner Ellipsoiden,\u201dArchiv der Mathematik (Basel) 8 (1957) 214\u2013219.","journal-title":"Archiv der Mathematik (Basel)"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01582241","volume":"33","author":"R.M. Freund","year":"1985","unstructured":"R.M. Freund and J.B. Orlin, \u201cOn the complexity of four polyhedral set containment problems,\u2019Mathematical Programming 33 (1985) 139\u2013145.","journal-title":"Mathematical Programming"},{"key":"CR5","first-page":"79","volume-title":"Trends in Mathematical Optimization. Proceedings of the 4th French\u2014German Conference on Optimization, Irsee, 1986, ISNM, Vol. 84","author":"J.L. Goffin","year":"1988","unstructured":"J.L. Goffin, \u201cAffine and projective transformations in nondifferential optimization,\u201d in: K.H. Hoffmann, J.-B. Hiriart-Urruty, C. Lemarechal and J. Zowe, eds.,Trends in Mathematical Optimization. Proceedings of the 4th French\u2014German Conference on Optimization, Irsee, 1986, ISNM, Vol. 84 (Birkhauser, Basel, 1988) pp. 79\u201391."},{"key":"CR6","first-page":"187","volume-title":"Studies and Essays, Courant Anniversary Volume","author":"F. John","year":"1948","unstructured":"F. John, \u201cExtremum problems with inequalities as subsidiary conditions,\u201d in:Studies and Essays, Courant Anniversary Volume (Interscience, New York, 1948) pp. 187\u2013204."},{"key":"CR7","volume-title":"Self-concordant functions and polynomial-time methods in convex programming","author":"Ju. E. Nesterov","year":"1989","unstructured":"Ju. E. Nesterov and A.S. Nemirovsky, \u201cSelf-concordant functions and polynomial-time methods in convex programming,\u201d USSR Academy of Sciences, Central Economic & Mathematical Institute (Moscow, 1989)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"J. Renegar, \u201cA polynomial-time algorithm, based on Newton's method, for linear programming,\u201dMathematical Programming 40 (1988) 59\u201393.","journal-title":"Mathematical Programming"},{"key":"CR9","first-page":"311","volume-title":"Trends in Mathematical Optimization, Proceedings of the 4th French\u2014German Conference on Optimization, Irsee, 1986, ISNM, Vol. 84","author":"G. Sonnevend","year":"1988","unstructured":"G. Sonnevend, \u201cNew algorithms in convex programming based on a notion of \u201ccentre\u201d (for systems of analytic inequalities) and on rational extrapolation,\u201d in: K.H. Hoffmann, J.-B. Hiriart-Urruty, C. Lemarechal and J. Zowe, eds.,Trends in Mathematical Optimization, Proceedings of the 4th French\u2014German Conference on Optimization, Irsee, 1986, ISNM, Vol. 84 (Birkhauser, Basel, 1988) pp. 311\u2013327."},{"key":"CR10","first-page":"71","volume-title":"Methods and Tools for Computer-Aided Design, Vol. 2","author":"S.P. Tarasov","year":"1986","unstructured":"S.P. Tarasov, L.G. Khachiyan and I.I. Erlikh, \u201cComputing the minimal covering ellipsoid for a system of points, in: O.L. Smirnov, ed.,Methods and Tools for Computer-Aided Design, Vol. 2 (Scientific Council on Cybernetics of the USSR Academy of Sciences, Moscow, 1986) pp. 71\u201378. [In Russian.]"},{"key":"CR11","first-page":"226","volume":"37","author":"S.P. Tarasov","year":"1988","unstructured":"S.P. Tarasov, L.G. Khachiyan, and I.I. Erlich, \u201cThe method of inscribed ellipsoids,\u201dSoviet Mathematics Doklady 37 (1988) 226\u2013230.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/biomet\/62.2.313","volume":"62","author":"D.M. Titterington","year":"1975","unstructured":"D.M. Titterington, \u201cOptimal design: some geometric aspects ofD-optimality,\u201dBiometrica 62 (1975) 313\u2013320.","journal-title":"Biometrica"},{"key":"CR13","first-page":"338","volume-title":"Proceedings of the 30th Annual FOCS Symposium, Research Triangle Park, NC, 1989","author":"P.M. Vaidya","year":"1990","unstructured":"P.M. Vaidya, \u201cA new algorithm for minimizing a convex function over convex sets,\u201dProceedings of the 30th Annual FOCS Symposium, Research Triangle Park, NC, 1989 (IEEE Computer Society Press, Los Alamitos, CA, 1990) pp. 338\u2013343."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1137\/0802002","volume":"2","author":"Y. Ye","year":"1992","unstructured":"Y. Ye, \u201cA potential reduction algorithm allowing column generation,\u201dSIAM Journal on Optimization 2 (1992) 7\u201320.","journal-title":"SIAM Journal on Optimization"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582144.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582144\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582144","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:15:46Z","timestamp":1556896546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["BF01582144"],"URL":"https:\/\/doi.org\/10.1007\/bf01582144","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}