On numerical solution of the maximum volume ellipsoid problem

SIAM Journal on Optimization

Volumn 14, Issue 1, 2004, Pages 53-76

  Zhang, Yin ^a   Gao, Liyan ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

Maximum volume ellipsoid problem; Primal dual interior point algorithms

Indexed keywords

EID: 1542291028     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623401397230     Document Type: Article

References (26)

1. K. M. ANSTREICHER, Improved complexity for maximum volume inscribed ellipsoids, SIAM J. Optim., 13 (2002), pp. 309-320.
2. M. DYER, A. FRIEZE, AND R. KANNAN, A random polynomial-time algorithm for estimating volumes of convex bodies, J. Assoc. Comput. Mach., 38 (1991), pp. 1-17.
3. A. EL-BAKRY, R. A. TAPIA, T. TSUCHIYA, AND Y. ZHANG, On the formulation of the primal-dual Newton interior-point method for nonlinear programming, J. Optim. Theory Appl., 89 (1996), pp. 507-541.
4. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.
5. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
6. R. A. HORN AND C. R. JOHNSON, Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1991.
7. F. JOHN, Extreme problems with inequalities as subsidiary conditions, in Studies and Essays Presented to R. Courant on His 60th Birthday, Interscience, New York, 1948, pp.187-204.
8. 5) volume algorithm for convex bodies, Random Structures Algorithms, 11 (1997), pp. 1-50.
9. L. KHACHIYAN, A polynomial algorithm in linear programming, Dokl. Akad. Nauk SSSR, 244 (1979), pp. 1093-1096.
10. L. KHACHIYAN, Rounding of polytopes in the real number model of computation, Math. Oper. Res., 21 (1996), pp. 307-320.
11. L. KHACHIYAN AND M. TODD, On the complexity of approximating the maximal inscribed ellipsoid for a polytope, Mathematical Programming, 61 (1993), pp. 137-159.
12. H. W. LENSTRA, JR., Integer programming with a fixed number of variables, Math. Oper. Res., 8 (1983), pp. 538-548.
13. L. LOVÁSZ, An Algorithmic Theory of Numbers, Graphs, and Convexity, CBMS-NSF Regional Conf. Ser. in Appl. Math. 50, SIAM, Philadelphia, 1986
14. L. LOVÁSZ AND M. SIMONOVITS, On the randomized complexity of volumes and diameters, in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, 1992, pp. 482-491.
15. R. D. C. MONTEIRO AND J. S. PANG, Properties of an interior-point mapping for nonlinear mixed complementarity problems, Math. Oper. Res., 21 (1996), pp. 629-654.
16. A. Nemirovskii, On self-concordant convex-concave functions, Optim. Methods Softw., 11/12 (1999), pp. 303-384.
17. Y. Nesterov And A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
18. YU. E. NESTEROV AND M. J. TODD, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim., 8 (1998), pp. 324-364.
19. A. SCHRIJVER, Theory of Linear and Integer Programming, John Wiley and Sons, Chichester, UK, 1986.
20. S. SILVEY AND D. TITTERINGTON, A geometric approach to optimal design theory, Biometrika, 60 (1973), pp. 21-32.
21. S. TARASOV, L. KHACHIYAN, AND I. ERLICH, The method of inscribed ellipsoid, Soviet Math. Dokl., 37 (1988), pp. 226-230.
22. D. TITTERINGTO, Optimal design: Some geometric aspects of d-optimality, Biometrika, 62 (1975), pp. 313-320.
23. 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.
24. E. WELZL, Smallest enclosing disks, balls and ellipsoids, in New Results and New Trends in Computer Sciences, Lecture Notes in Comput. Sci. 555, H. Maurer, ed., Springer, Berlin, 1991, pp. 359-370.
25. Y. YE, A new complexity result on minimization of a quadratic function with a sphere constraint, in Recent Advances in Global Optimization, C. Floudas and P. Pardalos, eds., Princeton University Press, Princeton, NJ, 1992, pp. 19-31.
26. Y. ZHANG, An Interior-Point Algorithm for the Maximum-Volume Ellipsoid Problem, Technical report TR98-15, CAAM Department, Rice University, Houston, TX, 1998 (revised 1999).