Computation of Minimum-Volume Covering Ellipsoids

References

• Barnes E. An algorithm for separating patterns by ellipsoids. IBM J. Res. Develop. (1982) 26(6):759–764Crossref, Google Scholar
• Bertsekas D.Nonlinear Programming (1999) (Athena Scientific, Belmont, MA) Google Scholar
• Croux C., Haesbroeck G., Rousseeuw P. J. Location adjustment for the minimum volume ellipsoid estimator. Statist. Comput. (2002) 12(3):191–200Crossref, Google Scholar
• Gill P. E., Murray W.Numerical Methods for Constrained Optimization (1974) (Academic Press, London, U.K.) Google Scholar
• Grötschel M., Lovasz L., Schrijver A.Geometric Algorithms and Combinatorial Optimization (1998) (Springer-Verlag, Berlin, Germany) Google Scholar
• Han J., Kamber M.Data Mining, Concepts and Techniques (2001) (Morgan Kaufmann Publishers, San Francisco, CA) Google Scholar
• Horn R., Johnson C.Matrix Analysis (1985) (Cambridge University Press, Cambridge, U.K) Crossref, Google Scholar
• John F. Extreme problems with inequalities as subsidiary conditions. Studies and Essays Presented to R. Courant on his 60th Birthday. January 8,1948 (1948) (Wiley Interscience, New York) 187–204Google Scholar
• Khachiyan L. Rounding of polytopes in the real number model of computation. Math. Oper. Res. (1996) 21(2):307–320Link, Google Scholar
• Khachiyan L., Todd M. On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Math. Programming (1993) 61:137–159Crossref, Google Scholar
• Knorr E., Ng R., Zamar R. Robust space transformations for distance-based operations. Proc. Seventh ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (2001) (ACM, New York) 126–135Crossref, Google Scholar
• Nesterov Y., Nemirovskii A.Interior-Point Polynomial Algorithms in Convex Programming (1994) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Powel M. J. D.Nonlinear Optimization 1981 (1982) (Academic Press, London, U.K) Google Scholar
• Toh K. Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities. Computational Optim. Appl. (1999) 14:309–330Crossref, Google Scholar
• Toh K., Todd M., Tütüncü R. Sdpt3—A Matlab software package for semidefinite programming. Optim. Methods Software (1999) 11:545–581Crossref, Google Scholar
• Tütüncü R., Toh K., Todd M. Solving semidefinite-quadratic-linear programs using SDPT-3. Math. Programming95(2):189–217Crossref, Google Scholar
• Vandenberghe L., Boyd S., Wu S. Determinant maximization with linear matrix inequality constraints. SIAM J. Matrix Anal. Appl. (1998) 19(2):499–533Crossref, Google Scholar
• Zhang Y. An interior-point algorithm for the maximum-volume ellipsoid problem. (1998) . Technical report TR98-15 Department of Computational and Applied Mathematics, Rice University, Houston, TXGoogle Scholar
• Zhang Y., Gao L. On numerical solution of the maximum volume ellipsoid problem. SIAM J. Optim. (2003) 14(1):53–76Crossref, Google Scholar