On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids

Discrete Applied Mathematics

Volumn 155, Issue 13, 2007, Pages 1731-1744

  Todd, Michael J ^a   Yildirim, E Alper ^b  

^a Cornell University   (United States)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

Approximation algorithms; Core sets; Ellipsoid method; L wner ellipsoid; Rounding of polytopes

Indexed keywords

APPROXIMATION ALGORITHMS; ASYMPTOTIC ANALYSIS; COMPUTATIONAL EFFICIENCY; OPTIMAL SYSTEMS; PROBLEM SOLVING;

CORE SETS; ELLIPSOID METHOD; LOWNER ELLIPSOID; ROUNDING OF POLYTOPES;

COMPUTATIONAL GEOMETRY;

EID: 34547419664     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.02.013     Document Type: Article

References (43)

1. 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. Math. Programming 61 (1993) 39-52
2. P.K. Aggarwal, R. Poreddy, K.R. Varadarajan, 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, pp. 263-272.
3. D.S. Ahipasaoglu, P. Sun, M.J. Todd, Linear convergence of a modified Frank-Wolfe algorithm for computing minimum volume enclosing ellipsoids, Technical Report TR 1452, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York, 2006.
4. Anstreicher K.M. Improved complexity for maximum volume inscribed ellipsoids. SIAM J. Optim. 13 2 (2003) 309-320
5. Atwood C.L. Sequences converging to D-optimal designs of experiments. Ann. Statist. 1 (1973) 342-352
6. Barequet G., and Har-Peled S. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. J. Algorithms 38 (2001) 91-109
7. M. Bǎdoiu, K.L. Clarkson, Smaller core-sets for balls, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 801-802.
8. M. Bǎdoiu, S. Har-Peled, P. Indyk, Approximate clustering via core-sets, in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 250-257.
9. C. Bouville, Bounding ellipsoid for ray-fractal intersection, in: SIGGRAPH, 1985, pp. 45-52.
10. Burrell B.P., and Todd M.J. The ellipsoid method generates dual variables. Math. Oper. Res. 10 (1985) 688-700
11. T.M. Chan, Faster core-set constructions and data stream algorithms in fixed dimensions, in: Proceedings of the 20th Annual ACM Symposium on Computational Geometry, 2004, pp. 152-159.
12. B. Chazelle, J. Matoušek, On linear-time deterministic algorithms for optimization problems in fixed dimension, in: Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 281-290.
13. Eberly D. 3D Game Engine Design (2001), Morgan Kaufmann, Los Altos, CA
14. Fedorov V.V. Theory of Optimal Experiments (1972), Academic Press, New York
15. Frank M., and Wolfe P. An algorithm for quadratic programming. Nav. Res. Logist. Quart. 3 (1956) 95-110
16. B. Gärtner, S. Schönherr, Exact primitives for smallest enclosing ellipses, in: Proceedings of the 13th Annual ACM Symposium on Computational Geometry, 1997, pp. 430-432.
17. Gill P.E., Murray W., and Saunders M.A. Methods for computing and modifying the LDV factors of a matrix. Math. Comput. 29 (1975) 1051-1077
18. F. Glineur, Pattern separation via ellipsoids and conic programming, Master's Thesis, Faculté Polytechnique de Mons, Belgium, 1998.
19. Goldfarb D., and Todd M.J. Modifications and implementation of the ellipsoid algorithm for linear programming. Math. Programming 23 (1982) 1-19
20. Grötschel M., Lovász L., and Schrijver A. Geometric Algorithms and Combinatorial Optimization (1988), Springer, New York
21. Guélat J., and Marcotte P. Some comments on Wolfe's 'away step'. Math. Programming 35 (1986) 110-119
22. F. John, Extremum problems with inequalities as subsidiary conditions, in: Studies and Essays, presented to R. Courant on his 60th birthday January 8, 1948, pp. 187-204. Interscience, New York, 1948, reprinted in: J. Moser, (ed.), Fritz John, Collected Papers, vol. 2, Birkhäuser, Boston, 1985, pp. 543-560.
23. Khachiyan L.G. Rounding of polytopes in the real number model of computation. Math. Oper. Res. 21 (1996) 307-320
24. Khachiyan L.G., and Todd M.J. On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Math. Programming 61 (1993) 137-159
25. Kumar P., Mitchell J.S.B., and Yi{dotless}ldi{dotless}ri{dotless}m E.A. Approximate minimum enclosing balls in high dimensions using core-sets. ACM J. Experimental Algorithmics 8 1 (2003)
26. Kumar P., and Yi{dotless}ldi{dotless}ri{dotless}m E.A. Minimum volume enclosing ellipsoids and core sets. J. Optim. Theory Appl. 126 1 (2005) 1-21
27. J. Matoušek, M. Sharir, E. Welzl, A subexponential bound for linear programming, in: Proceedings of the 8th Annual Symposium on Computational Geometry, 1992, pp. 1-8.
28. Nemirovskii A.S. On self-concordant convex-concave functions. Optim. Methods and Software 11/12 (1999) 303-384
29. Yu.E. Nesterov, Rounding of convex sets and efficient gradient methods for linear programming problems, Discussion Paper 2004-4, CORE, Catholic University of Louvain, Louvain-la-Neuve, Belgium, 2004.
30. Nesterov Yu.E., and Nemirovskii A.S. Interior Point Polynomial Methods in Convex Programming (1994), SIAM Publications, Philadelphia, PA
31. Silverman B.W., and Titterington D.M. Minimum covering ellipses. SIAM J. Sci. Statist. Comput. 1 (1980) 401-409
32. Silvey S., and Titterington D. A geometric approach to optimal design theory. Biometrika 62 (1973) 21-32
33. Sun P., and Freund R.M. Computation of minimum volume covering ellipsoids. Oper. Res. 52 (2004) 690-706
34. Titterington D.M. Optimal design: some geometrical aspects of D-optimality. Biometrika 62 2 (1975) 313-320
35. Titterington D.M. Estimation of correlation coefficients by ellipsoidal trimming. Appl. Statist. 27 3 (1978) 227-234
36. Todd M.J. On minimum volume ellipsoids containing part of a given ellipsoid. Math. Oper. Res. 7 (1982) 253-261
37. Toh K.C. Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities. Comput. Optim. Appl. 14 (1999) 309-330
38. Vandenberghe L., Boyd S., and Wu S. Determinant maximization with linear matrix inequality constraints. SIAM J. Matrix Anal. Appl. 19 2 (1998) 499-533
39. E. Welzl, Smallest enclosing disks (balls and ellipsoids), in: H. Maurer (Ed.), Proceedings of New Results and New Trends in Computer Science, vol. 555, Berlin, Germany, June 1991, Lecture Notes in Computer Science, Springer, Berlin, pp. 359-370.
40. Wolfe P. Convergence theory in nonlinear programming. In: Abadie J. (Ed). Integer and Nonlinear Programming (1970), North-Holland, Amsterdam 1-36
41. Wynn H.P. The sequential generation of D-optimum experimental design. Ann. Math. Statist. 41 (1970) 1655-1664
42. Y. Zhang, An interior-point algorithm for the maximum-volume ellipsoid problem, Technical Report TR98-15, Department of Computational and Applied Mathematics, Rice University, 1998.
43. Zhang Y., and Gao L. On numerical solution of the maximum volume ellipsoid problem. SIAM J. Optim. 14 (2003) 53-76