Minimum-volume enclosing ellipsoids and core sets

Journal of Optimization Theory and Applications

Volumn 126, Issue 1, 2005, Pages 1-21

  Kumar, P ^a   Yildirim, E ^b  

^a Florida State University   (United States)

^b Stony Brook University   (United States)

Author keywords

Approximation algorithms; Core sets; L wner ellipsoids

Indexed keywords

COMPUTATIONAL GEOMETRY;

APPROXIMATION METHODS; COMPLEXITY BOUNDS; CORE SET; FIRST-ORDER ALGORITHMS; LÖWNER ELLIPSOID; MINIMUM VOLUME ENCLOSING ELLIPSOIDS; ND 3; POINT SET; PROPERTY; SIMPLE++;

APPROXIMATION ALGORITHMS;

EID: 23744479417     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-005-2653-6     Document Type: Article

References (38)

1. SILVEY, S. and TITTERINGTON, D., A Geometric Approach to Optimal Design Theory, Biometrika, Vol. 62, pp. 21-32, 1973.
2. TITTERINGTON, D. M., Optimal Design: Some Geometrical Aspects of D-Optimality, Biometrika, Vol. 62, pp. 313-320, 1975.
3. WELZL, E., Smallest Enclosing Disks (Balls and Ellipsoids), New Results and New Trends in Computer Science, Edited by H. Maurer, Lecture Notes in Computer Science, Springer, Berlin, Germany, Vol. 555, pp. 359-370, 1991.
4. CHAZELLE, B., and MATOUŠEK, J., On Linear Time Deterministic Algorithms for Optimization Problems in Fixed Dimension, ACM-SIAM Symposium on Discrete Algorithms, pp. 281-290, 1993.
5. BAREQUET, G., and HAR-PELED, S., Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions, Journal of Algorithms, Vol. 38, pp. 91-109, 2001.
6. GRÖTSCHEL, M., LOVÁSZ, L., and SCHRIJVER, A., Geometric Algorithms and Combinatorial Optimization, Springer, New York, NY, 1988.
7. EBERLY, D., 3D Game Engine Design: A Practical Approach to Real-Time Computer Graphics, Morgan Kaufmann, San Francisco, California, 2001.
8. BOUVILLE, C., Bounding Ellipsoid for Ray-Fractal Intersection, Proceedings of the 12th Annual Conference on Computer Graphics and Interative Techniques, Vol. 19, pp. 45-52, 1985.
9. GLINEUR, F., Pattern Separation via Ellipsoids and Conic Programming, MS Thesis, Faculté Polytechnique de Mons, Mons, Belgium, 1998.
10. SILVERMAN, B. W., and TITTERINGTON, D. M., Minimum Covering Ellipses, SIAM Journal on Statistical and Scientific Computing, Vol. 1, pp. 401-409, 1980.
11. MOUNT, D. M., NETANYAHU, N. S., PIATKO, C. D., SILVERMAN, R., and WU, A. Y., Quantile Approximation for Robust Statistical Estimation and k-Enclosing Problems, International Journal of Computational Geometry and Applications, Vol. 10, pp. 593-608, 2000.
12. COMANICIU, D., and MEER, P., Robust Analysis of Feature Spaces: Color Image Segmentation, IEEE Conference on Computer Vision and Pattern Recognition, pp. 750-755, 1997.
13. JOLION, J. M., MEER, P., and BATAOUCHE, S., Robust Clustering with Applications in Computer Vision, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 13, pp. 791-802, 1991.
14. KNORR, E. M., NG, R. T., and ZAMAR, R. H., Robust Space Transformations for Distance-Based Operations, Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 126-135, 2001.
15. JOHN, F., Extremum Problems with Inequalities as Subsidiary Conditions, Studies and Essays in Honor of R. Courant, Wiley, Interscience, New York, NY, pp. 187-204, 1948
16. (see also Fritz John, Collected Papers, Edited by J. Moser, Birkhäuser, Boston, Massachusetts, Vol. 2, pp. 543-560, 1985).
17. TITTERINGTON, D. M., Estimation of Correlation Coefficients by Ellipsoidal Trimming, Applied Statistics, Vol. 27, pp. 227-234, 1978.
18. KHACHIYAN, L. G., Rounding of Polytopes in the Real Number Model of Computation, Mathematics of Operations Research, Vol. 21, pp. 307-320, 1996.
19. NESTEROV, Yu. E., and NEMIROVSKII, A. S., Interior-Point Polynomial Methods in Convex Programming, SIAM Publications, Philadelphia, Pennsylvania, 1994.
20. SUN, P., and FREUND, R. M., Computation of Minimum-Volume Covering Ellipsoids, Operations Research, 2004 (to appear).
21. MATOUŠEK, J., SHARIR, M., and WELZL, E., A Subexponential Bound for Linear Programming, Proceedings of the 8th Annual Symposium on Computational Geometry, pp. 1-8, 1992.
22. ADLER, I., and SHAMIR, R., A Randomization Scheme for Speeding Up Algorithms for Linear and Convex Quadratic Programming Problems with a High Constraints-to-Variables Ratio, Mathematical Programming, Vol. 61, pp. 39-52, 1993.
23. GÄRTNER, B., and SCHÖNHERR, S., Exact Primitives for Smallest Enclosing Ellipses, Proceedings of the 13th Annual ACM Symposium on Computational Geometry, pp. 430-432, 1997.
24. KHACHIYAN, L. G., and TODD, M. J., On the Complexity of Approximating the Maximal Inscribed Ellipsoid for a Polytope, Mathematical Programming, Vol. 61, pp. 137-159, 1993.
25. NEMIROVSKII, A. S., On Self-Concordant Convex-Concave Functions, Optimization Methods and Software, Vols. 11/12, pp. 303-384, 1999.
26. ZHANG, Y., An Interior-Point Algorithm for the Maximum-Volume Ellipsoid Problem, Technical Report TR98-15, Department of Computational and Applied Mathematics, Rice University, Houston, Texas, 1998.
27. ANSTREICHER, K. M., Improved Complexity for Maximum-Volume Inscribed Ellipsoids, SIAM Journal on Optimization, Vol. 13, pp. 309-320, 2003.
28. ZHANG, Y., and GAO, L., On Numerical Solution of the Maximum-Volume Ellipsoid Problem, SIAM Journal on Optimization, Vol. 14, pp. 53-76, 2003.
29. VANDENBERGHE, L., BOYD, S., and WU, S., Determinant Maximization with Linear Matrix Inequality Constraints, SIAM Journal on Matrix Analysis and Applications, Vol. 19, pp. 499-533, 1998.
30. TOH, K. C., Primal-Dual Path-Following Algorithm for Determinant Maximization Problems with Linear Matrix Inequalities, Computational Optimization and Applications, Vol. 14, pp. 309-330, 1999.
31. BǍDOIU, M., HAR-PELED, S., and INDYK, P., Approximate Clustering via Core Sets, Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 250-257, 2002.
32. BǍDOIU, M., and CLARKSON, K. L., Smaller Core Sets for Balls, Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, pp. 801-802, 2003.
33. KUMAR, P., MITCHELL, J. S. B., and YILDIRIM, E. A., Approximate Minimum Enclosing Balls in High Dimensions Using Core Sets, ACM Journal of Experimental Algorithmics (online), Vol. 8, 2003.
34. CHAN, T. M., Faster Core Set Constructions and Data-Stream Algorithms in Fixed Dimensions, Proceedings of the 20th Annual ACM Symposium on Computational Geometry, pp. 152-159, 2004.
35. AGGARWAL, P. K., POREDDY, R., VARADARAJAN, K. R., and YU, H., Practical Methods for Shape Fitting and Kinetic Data Structures Using Core Sets, Proceedings of the 20th Annual ACM Symposium on Computational Geometry, pp. 263-272, 2004.
36. BETKE, U., and HENK, M., Approximating the Volume of Convex Bodies, Discrete Computational Geometry, Vol. 10, pp. 15-21, 1993.
37. MATOUŠEK, J., Lectures on Discrete Geometry, Springer Verlag, Prague, Czech Republic, 2001.
38. TARASOV, S. P., KHACHIYAN, L. G., and ERLIKH, I. I., The Method of Inscribed Ellipsoids, Soviet Mathematics Doklady, Vol. 37, pp. 226-230, 1988.