Computation of minimum-volume covering ellipsoids

Operations Research

Volumn 52, Issue 5, 2004, Pages 690-706

  Sun, Peng ^a   Freund, Robert M ^b  

^a DUKE UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Data analysis; Mathematics: convexity; Large scale systems; statistics: cluster analysis; Matrices; Nonlinear: algorithms; Programming

Indexed keywords

ACTIVE-SET METHOD; CLUSTER ANALYSIS; CONVEXITY; INTERIOR-POINT METHODS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA REDUCTION; LARGE SCALE SYSTEMS; NONLINEAR PROGRAMMING; PROBLEM SOLVING; STATISTICAL METHODS;

ELLIPSOMETRY;

EID: 8344259908     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1040.0115     Document Type: Article

References (19)

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