On the minimum volume covering ellipsoid of ellipsoids

SIAM Journal on Optimization

Volumn 17, Issue 3, 2006, Pages 621-641

  Yildirim, E Alper ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

Approximation algorithms; Core sets; L wner ellipsoids; Minimum volume covering ellipsoids; Rounding of convex sets

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

CORE SETS; LÖWNER ELLIPSOIDS; MINIMUM VOLUME COVERING ELLIPSOIDS; ROUNDING OF CONVEX SETS;

GEOMETRY;

EID: 34547939835     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/050622560     Document Type: Article

References (37)

1. P. K. AGARWAL, R. POREDDY, K. R. VARADARAJAN, AND H. YU, Practical methods for shape fitting and kinetic data structures using core sets, in Proceedings of the 20th Annual ACM Symposium on Computational Geometry, 2004.
2. A. BEN-TAL AND A. NEMIROVSKI, Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, MPS/SIAM Ser. Optim. 2, SIAM, Philadelphia, 2001.
3. U. BETKK AND M. HENK, Approximating the volume of convex bodies, Discrete Comput. Geom., 10 (1993), pp. 15-21.
4. L. BLUM, M. SHUB, AND S. SMALE, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions, and universal machines, Bull. Amer. Math. Soc. (N.S.), 21 (1989), pp. 1-46.
5. S. BOYD, L. EL GHAOUI, E. FERON, AND V. BALAKRISHNAN, Linear Matrix Inequalities in System and Control Theory, SIAM Stud. Appl. Math. 15, SIAM, Philadelphia, 1994.
6. S. BOYD AND L. VANDENBERGHE, Convex Optimization, Cambridge University Press, Cambridge, UK, 2004.
7. M. BǍDOIU AND K. L. CLARKSON, Smaller core-sets for balls, in Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, 2003, Baltimore, MD, pp. 801-802.
8. M. BÄDOIU, S. HAR-PELED, AND P. INDYK, Approximate clustering via core-sets, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 250-257.
9. T. M. CHAN, Faster core-set constructions and data-stream algorithms in fixed dimensions, Comput. Geom., 35 (2006), pp. 20-35.
10. Y. CHIEN AND J. LIU, Improvements to ellipsoidal fit based collision detection, Tech. report TR-IIS-03-001, Academia Sinica, Institute of Information Science, Taiwan, Taipei, Republic of China, 2003.
11. J. H. CLARK, Hierarchical geometric models for visible surface algorithms, Commun. ACM, 19 (1976), pp. 547-554.
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, Interscience, New York, 1948, pp. 187-204;
14. reprinted in Fritz John, Collected Papers, Vol. 2, J. Moser, ed., Birkhäuser Boston, Boston, 1985, pp. 543-560.
15. M. JU, J. LIU, S. SHIANG, Y. CHIEN, K. HWANG, AND W. LEE, Fast and accurate, collision detection based on enclosed ellipsoids, Robotica, 19 (2001), pp. 381-394.
16. L. G. KHACHIYAN, Rounding of polytopes in the real number model of computation, Math. Oper. Res., 21 (1996), pp. 307-320.
17. L. G. KHACHIYAN AND M. J. TODD, On the complexity of approximating the maximal inscribed ellipsoid for a polytope, Math. Programming, 61 (1993), pp. 137-159.
18. P. KUMAR, J. S. B. MITCHELL, AND E. A. YILDIRIM, Approximate minimum enclosing balls in high dimensions using core-sets, ACM J. Exp. Algorithmics, 8 (2003), 29 pp.
19. P. KUMAR AND E. A. YILDIRIM, Minimum volume enclosing ellipsoids and core sets, J. Optim. Theory Appl., 126 (2005), pp. 1-21.
20. YU. NESTEROV AND A. NEMIROVSKII, Interior Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
21. I. PÓLIK AND T. TERLAKY, A comprehensive study of the S-lemma, Tech. report, McMaster University, Advanced Optimization Laboratory, Hamilton, ON, Canada, 2004.
22. L. PORKOLAB AND L. KHACHIYAN, On the complexity of semidefinite programs, J. Global Optim., 10 (1997), pp. 351-365.
23. M. V. RAMANA, An exact duality theory for semidefinite programming and its complexity implications, Math. Programming, 77 (1997), pp. 129-162.
24. F. RENDL AND H. WOLKOWICZ, A semidefinite framework for trust region subproblems with applications to large scale minimization, Math. Programming, 77 (1997), pp. 273-299.
25. J. RENEGAR, On the computational complexity and geometry of the first-order theory of the reals, Part I: Introduction; preliminaries; the geometry of the semi-algebraic sets; the decision problem for the existential theory of the reals, J. Symbolic Comput., 13 (1992), pp. 255 299.
26. E. RIMON AND S. BOYD, Obstacle collision detection using best ellipsoid fit, J. Intell, Robot. Syst., 18 (1997), pp. 105-126.
27. S. SHIANG, J. LIU, AND Y. CHIEN, Estimate of minimum, distance between convex polyhedra based on enclosed ellipsoids, in Proceedings of the 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2000, pp. 739-744.
28. R. J. STERN AND H. WOLKOWICZ, Indefinite trust region subproblems and nonsymmetric eigen-value perturbations, SIAM J. Optim., 5 (1995), pp. 286-313.
29. J. F. STURM AND S. Z. ZHANG, On cones of nonnegative quadratic functions, Math. Oper. Res., 28 (2003), pp. 246 267.
30. P. SUN AND R. M. FREUND, Computation of minimum, volume covering ellipsoids, Oper. Res., 52 (2004), pp. 690-706.
31. M. J. TODD AND E. A. YILDIRIM, On Khachiyan's algorithm for the computation of minimum volume enclosing ellipsoids, Tech. report TR 1435, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 2005.
32. K. C. TOH, Primal-dual path-following algorithms for determinant, maximization problems with linear matrix inequalities, Comput. Optim. Appl., 14 (1999), pp. 309-330.
33. L. VANDENBERGHE, S. BOYD, AND S.-P. WU, Determinant maximization with linear matrix inequality constraints, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 499 533.
34. V. A. YAKUBOVICH, S-procedure in nonlinear control theory, Vestn. Leningr. Univ., 4 (1977), pp. 73-93 (in English).
35. Y. YE, On affine scaling algorithms for nonconvex quadratic programming, Math. Programming, 56 (1992), pp. 285-300.
36. Y. YE, On the finite convergence of interior-point algorithms for linear programming, Math. Programming, 57 (1992), pp. 325-335.
37. Y. YE AND S. ZHANG, New results on quadratic minimization, SIAM J. Optim., 14 (2003), pp. 245-267.