Abstract
The volume is an important attribute of a convex body. In general, it is quite difficult to calculate the exact volume. But in many cases, it suffices to have an approximate value. Volume estimation methods for convex bodies have been extensively studied in theory, however, there is still a lack of practical implementations of such methods. In this paper, we present an efficient method which is based on the Multiphase Monte-Carlo algorithm to estimate volumes of convex polytopes. It uses the coordinate directions hit-and-run method, and employs a technique of reutilizing sample points. We also introduce a new result checking method for performance evaluation. The experiments show that our method can efficiently handle instances with dozens of dimensions with high accuracy.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
“soft-O” notation \(O^*\) indicates that we suppress factors of \(\log n\) as well as factors depending on other parameters like the error bound.
References
Dyer, M., Frieze, A.: On the complexity of computing the volume of a polyhedron. SIAM J. Comput. 17(5), 967–974 (1988)
Khachiyan, L.G.: On the complexity of computing the volume of a polytope. Izvestia Akad. Nauk SSSR Tekhn. Kibernet 3, 216–217 (1988)
Khachiyan, L.G.: The problem of computing the volume of polytopes is NP-hard. Uspekhi Mat. Nauk. 44, 179–180 (1989). In Russian; translation in. Russian Math. Surv. 44(3), 199–200
Büeler, B., Enge, A., Fukuda, K.: Exact volume computation for polytopes: a practical study. In: Kalai, G., Ziegler, G.M. (eds.) Polytopes—Combinatorics and Computation, pp. 131–154. Birkhäuser Verlag, Birkhäuser Basel (2000)
Dyer, M., Frieze, A., Kannan, R.: A random polynomial time algorithm for approximating the volume of convex bodies. In: 21st Annual ACM Symposium on Theory of Computing, pp. 375–381 (1989)
Lovász, L., Simonovits M.: Mixing rate of Markov chains, an isoperimetric inequality, and computing a the volume. In: 31st Annual Symposium on Foundations of Computer Science, Vol. I, II, pp. 346–354 (1990)
Kannan, R., Lovász, L., Simonovits, M.: Random walks and an \(O^*(n^5)\) volume algorithm for convex bodies. Random Struct. Algorithms 11(1), 1–50 (1997)
Lovász, L.: Hit-and-Run mixes fast. Math. Prog. 86(3), 443–461 (1999)
Lovász, L., Vempala, S.: Simulated annealing in convex bodies and an \(O^*(n^4)\) volume algorithm. J. Comput. Syst. Sci. 72(2), 392–417 (2006)
http://www.math.u-bordeaux1.fr/aenge/?category=software&page=vinci
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1993)
Goldfarb, D., Todd, M.J.: Modifications and implementation of the ellipsoid algorithm for linear programming. Math. Program. 23(1), 1–19 (1982)
Smith, R.L.: Efficient Monte-Carlo procedures for generating points uniformly distributed over bounded regions. Oper. Res. 32, 1296–1308 (1984)
Berbee, H.C.P., Boender, C.G.E., Ran, A.R., Scheffer, C.L., Smith, R.L., Telgen, J.: Hit-and-run algorithms for the identification of nonredundant linear inequalities. Math. Program. 37(2), 184–207 (1987)
Belisle, C.J.P., Romeijn, H.E., Smith, R.L.: Hit-and-run algorithms for generating multivariate distributions. Math. Oper. Res. 18(2), 255–266 (1993)
Liu, S., Zhang, J., Zhu, B.: Volume computation using a direct Monte Carlo method. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 198–209. Springer, Heidelberg (2007)
Lovász, L., Deák, I.: Computational results of an \(O^*(n^4)\) volume algorithm. Eur. J. Oper. Res. 216, 152–161 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
Appendix
A About the Number of Sample Points
From Formula (1),
which shows that to obtain confidence interval of \(vol(P)\), we only have to focus on \(\prod _{i=0}^{l-1} c_i\). For a fixed \(P\), \(\{\alpha _i\}\) are fixed numbers. Let \(c = \prod _{i=1}^{l}c_i\) and \(\mathbb {D}(l, P)\) denote the distribution of \(c\). With statistical results of substantial expriments on concentric balls, we observe that, when \(step\_size\) is sufficiently large, the distribution of \(c_i\) is unbiased and its standard deviation is smaller than twice of the standard deviation of binomial distribution in dimensions below 80. Though such observation sometimes not holds when we sample on convex bodies other than balls, we still use this to approximate the distribution of \(c_i\). Consider random variables \(X_i\) following binomial distribution \(\mathbb {B}(step\_size, 1 / \alpha _i)\), we have
where \(\beta = \prod _{i=1}^{l}(1 + \frac{4\alpha _i}{step\_size} - \frac{4}{step\_size})\).
Suppose \(\{\xi _1, \dots , \xi _{t}\}\) is a sequence of i.i.d. random variables following \(\mathbb {D}(l, P)\). Notice \(D(c)\), the variance of \(\mathbb {D}(l, P)\), is finite because \(\beta - 1 \rightarrow 0\) as \(t\rightarrow \infty \). According to central limit theorem, we have
So we obtain the approximation of \(95\,\%\) confidence interval of \(c\), \([E(c) - \sigma \sqrt{D(c)}, E(c) + \sigma \sqrt{D(c)}]\), where \(\sigma = 1.96\). And
Let \(\epsilon \in [0, 1]\) denote the ratio of confidence interval’s range to exact value of \(vol(P)\), that is
Solve inequality (9), we get \(\beta _1(\epsilon , \sigma )\), \(\beta _2(\epsilon , \sigma )\) that \(\beta \le \beta _1\) and \(\beta \ge \beta _2\) (ignore \(\beta \ge \beta _2\) because \(1 - \sigma \sqrt{\beta _2-1} < 0\)). \(\beta \le (1 + \frac{4}{step\_size})^l\), since \(1 \le \alpha _i \le 2\).
(10) is a sufficient condition of \(\beta \le \beta _1\). Furthermore, \(4 / (l\beta _1^{1 / l} - l)\) is nearly a constant as \(\epsilon \) and \(\sigma \) are fixed. For example, \(4 / (l\beta _1^{1 / l} - l) \approx 1569.2 \le 1600\) when \(\epsilon = 0.2\), \(\sigma = 1.96\). So \(step\_size = 1600l\) keeps the range of \(95\,\%\) confidence interval of \(vol(P)\) less than \(20\,\%\) of the exact value of \(vol(P)\).
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Ge, C., Ma, F. (2015). A Fast and Practical Method to Estimate Volumes of Convex Polytopes. In: Wang, J., Yap, C. (eds) Frontiers in Algorithmics. FAW 2015. Lecture Notes in Computer Science(), vol 9130. Springer, Cham. https://doi.org/10.1007/978-3-319-19647-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-19647-3_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19646-6
Online ISBN: 978-3-319-19647-3
eBook Packages: Computer ScienceComputer Science (R0)