On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids

[1]  Peng Sun,et al.  Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids , 2008, Optim. Methods Softw..

[2]  Yurii Nesterov,et al.  Rounding of convex sets and efficient gradient methods for linear programming problems , 2004, Optim. Methods Softw..

[3]  David H. Eberly,et al.  3D Game Engine Design, Second Edition: A Practical Approach to Real-Time Computer Graphics (The Morgan Kaufmann Series in Interactive 3D Technology) , 2006 .

[4]  Piyush Kumar,et al.  Minimum-Volume Enclosing Ellipsoids and Core Sets , 2005 .

[5]  Peng Sun,et al.  Computation of Minimum Volume Covering Ellipsoids , 2002, Oper. Res..

[6]  Timothy M. Chan.  Faster core-set constructions and data stream algorithms in fixed dimensions , 2004, SCG '04.

[7]  Pankaj K. Agarwal,et al.  Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets , 2004, SCG '04.

[8]  Joseph S. B. Mitchell,et al.  Approximate minimum enclosing balls in high dimensions using core-sets , 2003, ACM J. Exp. Algorithmics.

[9]  Kenneth L. Clarkson,et al.  Smaller core-sets for balls , 2003, SODA '03.

[10]  Yin Zhang,et al.  On Numerical Solution of the Maximum Volume Ellipsoid Problem , 2003, SIAM J. Optim..

[11]  Kurt M. Anstreicher,et al.  Improved Complexity for Maximum Volume Inscribed Ellipsoids , 2002, SIAM J. Optim..

[12]  Piotr Indyk,et al.  Approximate clustering via core-sets , 2002, STOC '02.

[13]  David H. Eberly,et al.  3D Game Engine Design , 2001 .

[14]  Kim-Chuan Toh,et al.  Primal-Dual Path-Following Algorithms for Determinant Maximization Problems With Linear Matrix Inequalities , 1999, Comput. Optim. Appl..

[15]  Sariel Har-Peled,et al.  Efficiently approximating the minimum-volume bounding box of a point set in three dimensions , 1999, SODA '99.

[16]  Yin Zhang.  An Interior-Point Algorithm for the Maximum-Volume Ellipsoid Problem , 1999 .

[17]  A. Nemirovski.  On self-concordant convex–concave functions , 1999 .

[18]  Stephen P. Boyd,et al.  Determinant Maximization with Linear Matrix Inequality Constraints , 1998, SIAM J. Matrix Anal. Appl..

[19]  F. Glineur.  Pattern separation via ellipsoids and conic programming , 1998 .

[20]  Bernd Gärtner,et al.  Exact Primitives for Smallest Enclosing Ellipses , 1998, Inf. Process. Lett..

[21]  Leonid Khachiyan,et al.  Rounding of Polytopes in the Real Number Model of Computation , 1996, Math. Oper. Res..

[22]  Bernard Chazelle,et al.  On linear-time deterministic algorithms for optimization problems in fixed dimension , 1996, SODA '93.

[23]  Leonid Khachiyan,et al.  On the complexity of approximating the maximal inscribed ellipsoid for a polytope , 1993, Math. Program..

[24]  Ron Shamir,et al.  A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio , 1993, Math. Program..

[25]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[26]  Emo Welzl,et al.  Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.

[27]  I. Adler,et al.  A randomization scheme for speeding up algorithms for linear and convex quadratic programming proble , 1990 .

[28]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[29]  Patrice Marcotte,et al.  Some comments on Wolfe's ‘away step’ , 1986, Math. Program..

[30]  Michael J. Todd,et al.  The Ellipsoid Method Generates Dual Variables , 1985, Math. Oper. Res..

[31]  Christian Bouville.  Bounding ellipsoids for ray-fractal intersection , 1985, SIGGRAPH '85.

[32]  Michael J. Todd,et al.  Modifications and implementation of the ellipsoid algorithm for linear programming , 1982, Math. Program..

[33]  Michael J. Todd.  On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid , 1982, Math. Oper. Res..

[34]  D. Titterington,et al.  Minimum Covering Ellipses , 1980 .

[35]  D. Titterington.  Estimation of Correlation Coefficients by Ellipsoidal Trimming , 1978 .

[36]  D. Titterington.  Optimal design: Some geometrical aspects of D-optimality , 1975 .

[37]  P. Gill,et al.  Methods for computing and modifying the $LDV$ factors of a matrix , 1975 .

[38]  S. Silvey,et al.  A geometric approach to optimal design theory , 1973 .

[39]  C. Atwood.  Sequences Converging to $D$-Optimal Designs of Experiments , 1973 .

[40]  W. J. Studden,et al.  Theory Of Optimal Experiments , 1972 .

[41]  B. V. Shah,et al.  Integer and Nonlinear Programming , 1971 .

[42]  H. Wynn.  The Sequential Generation of $D$-Optimum Experimental Designs , 1970 .

[43]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .