Improved complexity for maximum volume inscribed ellipsoids

SIAM Journal on Optimization

Volumn 13, Issue 2, 2003, Pages 309-320

  Anstreicher, Kurt M ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

Inscribed ellipsoid method; Maximum volume inscribed ellipsoid

Indexed keywords

EID: 0037797240     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623401390902     Document Type: Article

References (17)

1. K.M. ANSTREICHER, On Vaidya'a volumetric cutting plane method for convex programming, Math. Oper. Res., 22 (1997), pp. 63-89.
2. K.M. ANSTREICHER, Ellipsoidal approximations of convex sets based on the volumetric barrier, Math. Oper. Res., 24 (1999), pp. 193-203.
3. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
4. D. DEN HERTOG, Interior Point Approach to Linear, Quadratic, and Convex Programming- Algorithms and Complexity, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1994.
5. R.A. HORN AND C.R. JOHNSON, Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1991.
6. F. JOHN, Extremum problems with inequalities as subsidiary conditions, in Studies and Essays, Presented to R. Courant on His 60th Birthday, January 8, 1948, Wiley Interscience, New York, pp. 187-204.
7. 5) volume algorithm for convex bodies, Random Structures Algorithms, 11 (1997), pp. 1-50.
8. L.G. KHACHIYAN, Hounding of polytopes in the real number model of computation, Math. Oper. Res., 21 (1996), pp. 307-320.
9. L.G. KHACHIYAN AND M.J. TODD, On the complexity of approximating the maximal volume inscribed ellipsoid for a polytope, Math. Programming, 61 (1993), pp. 137-159.
10. H.W. LENSTRA, JR., Integer programming with a fixed number of variables, Math. Oper. Res., 8 (1983), pp. 538-548.
11. A. NEMIROVSKII, On Self-Concordant Concave-Convex functions, Faculty of Industrial Engineering and Management, Technion, Haifa, Israel, 1997.
12. Y. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
13. A.S. NEMIROVSKII AND D.B. YUDIN, Problem Complexity and Method Efficiency in Optimization, John Wiley, Chichester, UK, 1983.
14. S.P. TARASOV, L.G. KHACHIYAN, AND I.I. ERLICH, The method of inscribed ellipsoids, Soviet Math. Dokl., 27 (1988), pp. 226-230.
15. P.M. VAIDYA, A new algorithm for minimizing convex functions over convex sets, Math. Programming, 73 (1996), pp. 291-341.
16. Y. ZHANG, An Interior-Point Algorithm for the Maximum-Volume Ellipsoid Problem, Technical report TR98-15, Center for Computational and Applied Mathematics, Rice University, Houston, TX, 1998.
17. Y. ZHANC AND L. GAO, On Numerical Solution of the Maximum Volume Ellipsoid Problem, Technical report TR01-15, Center for Computational and Applied Mathematics, Rice University, Houston, TX, 2001.