Random walks and an O*(n5) volume algorithm for convex bodies

Random Structures and Algorithms

Volumn 11, Issue 1, 1997, Pages 1-50

  Kannan, Ravi ^a   Lovász, László ^b   Simonovits, Miklós ^c  

^a Carnegie Mellon University   (United States)

^b Yale University   (United States)

^c ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039468442     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199708)11:1<1::AID-RSA1>3.0.CO;2-X     Document Type: Article

References (26)

1. D. Applegate and R. Kannan, Sampling and integration of near log-concave functions, Proc. 23th Annual ACM Symp. on Theory of Computing, 1990, pp. 156-163.
2. I. Bárány and Z. Füredi, Computing the volume is difficult, Proc. 18th Annual ACM Symposium on Theory of Computing, 1986, pp. 442-447.
3. C. Borell, The Brunn-Minkowski inequality in Gauss spaces, Invent. Math., 30, 207-216 (1975).
4. M. Dyer and A. Frieze, On the complexity of computing the volume of a polytope, SIAM J. Comput., 17, 967-974 (1988).
5. M. Dyer and A. Frieze, Computing the volume of convex bodies: a case where randomness provably helps, in Probabilistic Combinatorics and Its Applications, Béla Bollobás, Ed., Proceedings of Symposia in Applied Mathematics, Vol. 44, 1992, pp. 123-170.
6. M. Dyer, A. Frieze, and R. Kannan, A random polynomial time algorithm for approximating the volume of convex bodies, Proc. 21st Annual ACM Symp. on Theory of Computing, 1989, pp. 375-381.
7. G. Elekes, A geometric inequality and the complexity of computing volume, Discrete Comput. Geom., 1, 289-292 (1986).
8. J. A. Fill, Eigenvalue bounds on convergence to stationarity for nonreversible Markov Chains, with an application to the Exclusion Process, Ann. Appl. Probab., 1, 62-87 (1991).
9. M. Gromov and V. D. Milman, Brunn theorem and a concentration of volume of convex bodies, GAFA Seminar Notes, Tel Aviv University, 1984.
10. M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, New York, 1988.
11. P. M. Gruber and J. M. Wills, Eds., Handbook of Convex Geometry, Elsevier Science, Amsterdam, 1993.
12. B. Grünbaum, Partitions of mass-distributions and of convex bodies by hyperplanes, Pacific J. Math., 10, 1257-1261 (1960).
13. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theor. Comput. Sci., 43, 169-188 (1986).
14. R. Kannan, L. Loväsz, and M. Simonovits, Isoperimetric problems for convex bodies and a localization lemma, Discrete Comput. Geom., 13, 541-559 (1995).
15. L. G. Khachiyan, On the complexity of computing the volume of a polytope, Izv. Akad. Nauk SSSR, Eng. Cybernet., 3, 216-217 (1988).
16. L. G. Khachiyan, The problem of computing the volume of polytopes is NP-hard, Usp. Mat. Nauk, 44, 199-200 (1989).
17. L. G. Khachiyan, Complexity of polytope volume computation, in New Trends in Discrete and Computational Geometry, J. Pach, Ed., Springer-Verlag, New York, 1993, pp. 91-101.
18. J. Lawrence, Polytope volume computation, Preprint NISTIR 89-4123, U.S. Dept. of Commerce, Natl. Inst. of Stand. Tech., Gaithersburg, MD, 1989.
19. L. Lovász, An Algorithmic Theory of Numbers, Graphs and Convexity, CBMS-NSF Regional Conference Series in Applied Mathematics 50, SIAM, Philadelphia, 1986.
20. L. Lovász, How to compute the volume? in Jber. der Dt. Mathematik Verein, Jubiläumstagung 1990, B. G. Teubner, Stuttgart, 1992, pp. 138-151.
21. L. Lovász and M. Simonovits, Mixing rate of Markov chains, an isoperimetric inequality, and computing the volume, Proc. 31st Annual Symp. on Found. of Computer Science, IEEE Computer Soc., Washington, DC. 1990, pp. 346-355.
22. L. Lovász and M. Simonovits, On the randomization complexity of volume and diameter, Proc. 33rd Annual Symp. on Found. of Computer Science, IEEE Comp. Soc., Washington, DC. 1992, pp. 482-491.
23. L. Lovász and M. Simonovits, Random walks in a convex body and an improved volume algorithm, Random Struct. Alg., 4, 359-412 (1993).
24. V. D. Milman and A. Pajor, Isotropic position and inertia ellipsoids and zonoids of the unit ball of a normed n-dimensional space, in GAFA Seminar Notes, J. Lindenstrauss and V. D. Milmen, Eds. Tel Aviv University, Lecture Notes in Math. 1376, Springer-Verlag, New York, 1987, pp. 64-104.
25. A. Sinclair and M. Jerrum, Conductance and the rapid mixing property for Markov chains: the approximation of the permanent resolved, Proc. 20th AnnualACM Symp. on Theory of Computing, 1988, pp. 235-244.
26. G. Sonnevend, Applications of analytic centers for the numerical solution of semiinfinite, convex programs arising in control theory, DFG Report No. 170/1989, Univ. Würzburg, Institut für Angewandte Mathematik, Würzburg, 1989.