Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies

References

• Ahipaşaoğlu , S. D. August 2009 . “ Solving ellipsoidal inclusion and optimal experimental design problems: Theory and algorithms ” . August , Ithaca, New York : Cornell University . Ph.D. thesis
   Google Scholar
• Ahipaşaoğlu , S. D. , Sun , P. and Todd , M. J. 2008 . Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids . Optim. Methods Softw. , 23 ( 1 ) : 5 – 19 .
   Web of Science ®Google Scholar
• Ball , K. 1997 . “ An elementary introduction to modern convex geometry ” . In Flavors of Geometry , Vol. 31 , 1 – 58 . Cambridge : Cambridge University Press . Mathematical Sciences Research Institute Publications
   Google Scholar
• Barnes , E. R. and Moretti , A. C. 2005 . Some results on centers of polytopes . Optim. Methods Softw. , 20 ( 1 ) : 9 – 24 .
   Web of Science ®Google Scholar
• Barvinok , A. and Blekherman , G. 2005 . “ Convex geometry of orbits ” . In Combinatorial and Computational Geometry , Vol. 52 , 51 – 77 . Cambridge : Cambridge University Press . Mathematical Sciences Research Institute Publications
   Google Scholar
• Behrend , F. 1938 . Über die kleinste umbeschriebene und die größte einbeschriebene Ellipse eines konvexen Bereichs . Math. Ann. , 115 ( 1 ) : 379 – 411 .
   Google Scholar
• Bland , R. G. , Goldfarb , D. and Todd , M. J. 1981 . The ellipsoid method: A survey . Oper. Res. , 29 ( 6 ) : 1039 – 1091 .
   Web of Science ®Google Scholar
• Blekherman , G. 2004 . Convexity properties of the cone of nonnegative polynomials . Discrete Comput. Geom. , 32 ( 3 ) : 345 – 371 .
   Web of Science ®Google Scholar
• Brickman , L. and Steinberg , L. 1962 . Classroom notes: On nonnegative polynomials . Amer. Math. Monthly , 69 ( 3 ) : 218 – 221 .
   Web of Science ®Google Scholar
• Danzer , L. , Laugwitz , D. and Lenz , H. 1957 . Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden . Arch. Math. , 8 : 214 – 219 .
   Google Scholar
• Danzer , L. , Grünbaum , B. and Klee , V. 1963 . “ Helly's Theorem and its Relatives ” . In Proceedings of Symposia in Pure Mathematics , Vol. VII , 101 – 180 . Providence , RI : American Mathematical Society .
   Google Scholar
• Fedorov , V. V. 1972 . “ Theory of Optimal Experiments ” . In Probability and Mathematical Statistics , Vol. 12 , New York : Academic Press .
   Google Scholar
• Grötschel , M. , Lovász , L. and Schrijver , A. 1993 . “ Geometric Algorithms and Combinatorial Optimization ” . In Algorithms and Combinatorics , 2 , Vol. 2 , Berlin : Springer-Verlag .
   Google Scholar
• Gruber , P. M. 1988 . Minimal ellipsoids and their duals . Rend. Circ. Mat. Palermo (2) , 37 ( 1 ) : 35 – 64 .
   Google Scholar
• Grünbaum , B. 1964 . Fixing systems and inner illumination . Acta Math. Acad. Sci. Hungar , 15 : 161 – 163 .
   Google Scholar
• Güler , O. 2010 . “ Foundations of Optimization ” . In Graduate Texts in Mathematics , Vol. 258 , New York : Springer .
   Google Scholar
• Gürtuna , F. 2009 . Duality of ellipsoidal approximations via semi-infinite programming . SIAM J. Optim. , 20 ( 3 ) : 1421 – 1438 .
   Web of Science ®Google Scholar
• John , F. Extremum problems with inequalities as subsidiary conditions . Studies and Essays Presented to R. Courant on his 60th Birthday . January 8 1948 . pp. 187 – 204 . New York : Interscience Publishers, Inc .
   Google Scholar
• Khachiyan , L. G. 1979 . A polynomial algorithm in linear programming . Dokl. Akad. Nauk SSSR , 244 ( 5 ) : 1093 – 1096 .
   Google Scholar
• Khachiyan , L. G. and Todd , M. J. 1993 . On the complexity of approximating the maximal inscribed ellipsoid for a polytope . Math. Program. , 61 ( 2, Ser. A ) : 137 – 159 .
   Web of Science ®Google Scholar
• Knapp , A. W. 2002 . “ Lie Groups beyond an Introduction ” . In Progress in Mathematics , 2 , Vol. 140 , Boston , MA : Birkhäuser Boston Inc .
   Google Scholar
• König , H. and Pallaschke , D. 1980/1981 . On Khachiyan's algorithm and minimal ellipsoids . Numer. Math. , 36 ( 2 ) : 211 – 223 .
   Web of Science ®Google Scholar
• Laugwitz , D. 1965 . Differential and Riemannian Geometry , New York : Academic Press .
   Google Scholar
• Ledoux , M. 2001 . “ The Concentration of Measure Phenomenon ” . In Mathematical Surveys and Monographs , Vol. 89 , Providence , RI : American Mathematical Society .
   Google Scholar
• Monteiro , R. D.C. , O'Neal , J. W. and Nemirovski , A. S. 2004 . “ A new conjugate gradient algorithm incorporating adaptive ellipsoid preconditioning ” . Working paper, School of ISyE, Georgia Tech
   Google Scholar
• Onishchik , A. L. and Vinberg , È. B. 1990 . “ Lie Groups and Algebraic Groups ” . In Springer Series in Soviet Mathematics , Berlin : Springer-Verlag .
   Google Scholar
• Pisier , G. 1989 . “ The Volume of Convex Bodies and Banach Space Geometry ” . In Cambridge Tracts in Mathematics , Vol. 94 , Cambridge : Cambridge University Press .
   Google Scholar
• Pólik , I. and Terlaky , T. 2007 . A survey of the S-lemma . SIAM Rev. , 49 ( 3 ) : 371 – 418 .
   Web of Science ®Google Scholar
• Polyak , B. T. 1998 . Convexity of quadratic transformations and its use in control and optimization . J. Optim. Theory Appl. , 99 ( 3 ) : 553 – 583 .
   Web of Science ®Google Scholar
• Rockafellar , R. T. 1997 . “ Convex Analysis ” . In Princeton Landmarks in Mathematics , Princeton , NJ : Princeton University Press . (Reprint of the 1970 original, Princeton Paperbacks.)
   Google Scholar
• Rudelson , M. 1997 . Contact points of convex bodies . Israel J. Math. , 101 : 93 – 124 .
   Web of Science ®Google Scholar
• Shor , N. Z. and Gershovich , V. I. 1979 . Family of algorithms for solving convex programming problems . Cybernetics , 15 : 502 – 508 .
   Google Scholar
• Sun , P. and Freund , R. M. 2004 . Computation of minimum-volume covering ellipsoids . Oper. Res. , 52 ( 5 ) : 690 – 706 .
   Web of Science ®Google Scholar
• Tarasov , S. P. , Khachiyan , L. G. and Èrlikh , I. I. 1988 . The method of inscribed ellipsoids . Dokl. Akad. Nauk SSSR , 298 ( 5 ) : 1081 – 1085 .
   Google Scholar
• Titterington , D. M. 1975 . Optimal design: Some geometrical aspects of D-optimality . Biometrika , 62 ( 2 ) : 313 – 320 .
   Web of Science ®Google Scholar
• Todd , M. J. 1982 . On minimum volume ellipsoids containing part of a given ellipsoid . Math. Oper. Res. , 7 ( 2 ) : 253 – 261 .
   Web of Science ®Google Scholar
• Wynn , H. P. 1972 . Results in the theory and construction of D-optimum experimental designs . J. R. Stat. Soc. Ser. B , 34 : 133 – 147 . 170–186. (With discussion by M.J. Box, P. Whittle, S.D. Silvey, A.A. Greenfield, Agnes M. Herzberg, J. Kiefer, D.R. Cox, Lynda V. White, A.C. Atkinson, R.J. Brooks, Corwin L. Atwood, and Robin Sibson, and replies by Henry P. Wynn and P.J. Laycock.)
   Google Scholar
• Yıldırım , E. A. 2006 . On the minimum volume covering ellipsoid of ellipsoids . SIAM J. Optim. , 17 ( 3 ) : 621 – 641 .
   Web of Science ®Google Scholar
• Zaguskin , V. L. 1958 . Circumscribed and inscribed ellipsoids of extremal volume . Uspehi Mat. Nauk , 13 ( 6(84) : 89 – 93 .
   Google Scholar
• Zhang , Y. and Gao , L. 2003 . On numerical solution of the maximum volume ellipsoid problem . SIAM J. Optim. , 14 ( 1 ) : 53 – 76 .
   Web of Science ®Google Scholar