Rounding of polytopes in the real number model of computation

Mathematics of Operations Research

Volumn 21, Issue 2, 1996, Pages 307-320

  Khachiyan, Leonid G ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

L wner ellipsoid; Real number model of computation; Rounding of polytopes; Strongly polynomial algorithm

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; DIGITAL ARITHMETIC; NUMBER THEORY; POLYNOMIALS; PROBLEM SOLVING;

ARITHMETIC OPERATIONS; LOWNER ELLIPSOID; REAL NUMBER MODEL OF COMPUTATION; ROUNDING OF POLYTOPES;

COMPUTATIONAL METHODS;

EID: 0030134435     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.21.2.307     Document Type: Article

References (24)

1. Beckenbach, E. F. and R. Bellman (1961). Inequalities, Springer, New York.
2. Burrel, B. and M. J. Todd (1985). The ellipsoid method generates dual variables. Math. Oper. Res. 10 688-700.
3. Dyer, M., A. Frieze and R. Kannan (1991). A random polynomial-time algorithm for estimating volumes of convex bodies. J. Assoc. Comput. Mach. 38 1-17.
4. Fedorov, V. (1972). Theory of Optimal Experiments, Academic Press, NY.
5. Goffin, J.-L. (1984). Variable metric relaxation methods, Part II. Math. Programming 30 147-162.
6. Grötschel, M., L. Lovász and A. Schrijver (1981). The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 169-197.
7. _, _ and _ (1988). Geometric Algorithms and Combinatorial Optimization, Springer, New York.
8. John, F. (1948). 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, 187-204.
9. Khachiyan, L. and M. J. Todd (1993). On the complexity of approximating the maximum inscribed ellipsoid for a polytope. Math. Programming 61 137-159.
10. Kiefer, J. and J. Wolfowitz (1960). The equivalence of two extremum problems. Canad. J. Math. 12 363-366.
11. Lenstra, H. W., Jr. (1983). Integer programming with a fixed number of variables. Math. Oper. Res. 8 538-548.
12. Lovász, L. and M. Simonovits (1992). On the randomized complexity of volume and diameter. Proc. 33rd Annual Symp. on Foun. of Computer Sci., 482-491.
13. Nesterov, Yu. and A. Nemirovsky (1989). Self-Concordant Functions and Polynomial Time Methods in Convex Programming, Report, Central Economical and Mathematical Institute, USSR Academy of Sci., Moscow.
14. _ and _ (1994). Interior-Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics 13, SIAM, Philadelphia.
15. Schrijver, A. (1986). Theory of Linear and Integer Programming, Wiley, New York.
16. Sharir, M. and E. Welzl (1992). A combinatorial bound for linear programming and related problems. Proc. 9th Symp. on Theoret. Aspects of Computer Sci.
17. Shor, N. and O. Berezovski (1992). New algorithms for constructing circumscribed and inscribed ellipsoids. Optimization Methods and Software 1 283-299.
18. Sibson, R. (1972). Discussion on a paper by H. P. Wynn. J. Roy. Statist. Soc. Ser. B 34 181-183.
19. Silvey, S. and D. Titterington (1973). A geometric approach to optimal design theory. Biometrika 62 21-32.
20. Sonnevend, G. (1988). New algorithms in convex programming based on a notion of "centre" (for systems of analytic inequalities) and on rational extrapolation. J. Zowe, Ed., Trends in Mathematical Optimization, Proc. 4th French-German Conference on Optimization, Irzee, 1986, ISNM, Vol. 84, Birkhauser, Basel, 311-327.
21. Tarasov, S., L. Khachiyan and I. Ehrlich (1986). An algorithm for computing the minimum covering ellipsoid for a system of points. O. Smirnov, ed., Computer-Aided Design, Vol. 2, All-Union Research Institute for System Studies, Moscow, 71-78 (in Russian).
22. _, _ and _ (1988). The method of inscribed ellipsoids. Soviet Math. Doklady 37 266-230.
23. Titterington, D. (1975). Optimal design: some geometric aspects of D-optimality. Biometrika 60 313-320.
24. Welzl, E. (1991). Smallest enclosing disks, balls and ellipsoids. H. Maurer, Ed., New Results and New Trends in Computer Science, Springer Lecture Notes in Computer Science 555, New York, 359-370.