A note on approximate minimum volume enclosing ellipsoid of ellipsoids

Proceedings - The International Conference on Computational Sciences and its Applications, ICCSA 2008

Volumn , Issue , 2008, Pages 478-487

  Jambawalikar, Sachin ^a   Kumar, Piyush ^b  

^a STONY BROOK UNIVERSITY   (United States)

^b Florida State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL SCIENCES; INTERNATIONAL CONFERENCES;

EID: 52249104947     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCSA.2008.24     Document Type: Conference Paper

References (32)

1. G. Barequet and S. Har-Peled. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. J. Algorithms, 38:91-109, 2001. http://valis.es.uiuc.edu/~sariel/research/ papers/98/bbox.pdf.
2. A. Ben-Tal and A. Nemirovski. Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization. SIAM, 2001.
3. U. Betke and M. Henk. Approximating the volume of convex bodies. Discrete Computational Geometry, 10:15-21, 1993.
4. L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and real computation. Springer-Verlag New York, Inc., 1998.
5. C. Bouville. Bounding ellipsoid for ray-fractal intersection. In SIGGRAPH, pages 45-52, 1985.
6. M. Bǎdoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. Proc. 34th Annu. ACM Sympos. on Theory of Computing, pages 250-257, 2002. http://valis.es.uiuc.edu/~sariel/papers/02/coreset/coreset.pdf.
7. B. Chazelle and J. Matoušek. On linear-time deterministic algorithms for optimization problems in fixed dimension. In SODA: ACM-SIAM Symposium on Discrete Algorithms, pages 281-290, 1993.
8. D. Eberly. 3D Game Engine Design. Morgan Kaufmann, 2001.
9. W. Gander, G. H. Golub, and U. von Matt. A constrained eigenvalue problem. Linear Algebra and its Applications, 114-115(1):815-839, 1989.
10. P. E. Gill and W. Murray. Numerical Methods for Constrained Optimization. Academic Press, 1974.
11. F. Glineur. Pattern separation via ellipsoids and conic programming. Master's thesis, Faculté Polytechnique de Mons, Belgium, 1998.
12. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer, New York, 1988.
13. F. John. Extremum problems with inequalities as subsidiary conditions. In Studies and Essays, presented to R. Courant on his 60th birthday January 8, 1948, pages 187-204. Interscience, New York, 1948. Reprinted in: Fritz John, Collected Papers Volume 2 (J. Moser, ed), Birkhäuser, Boston, 1985, pp. 543-560.
14. L. G. Khachiyan. Rounding of polytopes in the real number model of computation. Mathematics of Operations Research, 21:307-320, 1996.
15. L. G. Khachiyan and M. J. Todd. On the complex-ity of approximating the maximal inscribed ellipsoid for a polytope. Mathematical Programming, 61:137-159, 1993.
16. P. Kumar, J. S. B. Mitchell, and A. Yildinm. Approximate minimum, enclosing balls in high dimensions using core-sets. The ACM Journal of Experimental Algorithmics, 8(1), 2003. http://www.compgeom.com/meb/.
17. P. Kumar and A. Yildinm. Minimum volume enclosing ellipsoids and core sets. Journal of Optimization Theory and Applications, 126, 2005. To appear, http://www.ams.sunysb.edu/~piyush/papers/mve.pdf.
18. H. W. Lenstra, Jr. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8:538-548, 1983.
19. O. E. Livne and A. Brandt. N roots of the secular equation in O(N) operations. SIAM Journal of Matrix Anal. Appl., 24:439-453, 2002.
20. J. Matousek, M. Shark, and E. Welzl. A subexponential bound for linear programming. In Proceedings of the eighth annual symposium on Computational geometry, pages 1-8, 1992.
21. D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu. Quantile approximation for robust statistical estimation and κ-enclosing problems. International Journal, of Computational Geometry and Applications, 10(6):593-608, 2000.
22. Y. E. Nesterov and A. S. Nemirovskii. Interior Point Polynomial Methods in Convex Programming. SLAM Publications, Philadelphia, 1994.
23. E. Rimon and S. P. Boyd. Obstacle collision detection using best ellipsoid fit. J. Intell. Robotics Syst., 18(2):105-126, 1997.
24. A. Rybalov. On the P-NP problem over real matrix rings. Theor. Comput. Sci., 314(1):281-285, 2004.
25. B. W. Silverman and D. M. Titterington. Minimum covering ellipses. SIAM J. Sci. Statist. Comput., 1:401-409, 1980.
26. S. Silvey and D. Titterington. A geometric approach to optimal design theory. Biometrika, 62:21-32, 1973.
27. J. F. Sturm and S. Zhang. On cones of nonnegative quadratic functions. Math. Oper. Res., 28(2):246-267, 2003. http ://www.optimization-online. org/DB_FILE/2001/05/324.pdf.
28. P. Sun and R. M. Freund. Computation of minimum volume covering ellipsoids. Technical report, MIT Operations Research Center, 2002.
29. S. P. Tarasov, L. G. Khachiyan, and I. I. Erlikh. The method of inscribed ellipsoids. Soviet Mathematics Doklady, 37:226-230, 1988.
30. D. M. Titterington. Optimal design: some geometrical aspects of D-optimality. Biometrika, 62(2):313-320, 1975.
31. E. Welzl. Smallest enclosing disks (balls and ellipsoids). In H. Maurer, editor, Proceedings of New Results and New Trends in Computer Science, volume 555 of LNCS, pages 359-370, Berlin, Germany, June 1991. Springer.
32. A. Yildirim. On the minimum volume covering ellipsoid of ellipsoids. Unpublished Manuscript, http ://www.optimization-online.org/DB_FILE/2005/01/ 1043.pdf.