Abstract
Recently an \(O^*(n^4)\) volume algorithm has been presented for convex bodies by Lovász and Vempala, where \(n\) is the number of dimensions of the convex body. Essentially the algorithm consists of several, interlocked simulational steps of slightly different natures. A computer implementation was later developed to gather some information about the numerical aspects of the algorithm, the number of dimensions in the examples was at most 10, and the errors of the results were somewhat dissatisfying. Now we present a parallel version of the improved algorithm, where variance reducing was added to make the algorithm faster, and the use of a GPU with 480 processors made experimentation easier. Computational results for convex bodies in dimensions ranging from 2 to 20 are presented as well.
Similar content being viewed by others
References
Bertsekas DP, Tsitsiklis JN (1989) Parallel and distributed computation—numerical methods. Prentice Hall, Englewood Cliffs
Deák I (1979) Comparison of methods for generating uniformly distributed random points in and on a hyperspere. Problems of Control and Information Theory 8:105–113
Deák I (1990) Random number generators and simulation. In: Prékopa A (ed) Mathematical methods of operations research (series). Akadémiai Kiadó (Publishing House of the Hungarian Academy of Sciences), Budapest
Deák I (2002) Probabilities of simple \(n\)-dimensional sets in case of normal distribution. IIE Trans (Operations Engineering) 34:1–18
Deák I (2011) Efficiency of Monte Carlo computations in very high dimensional spaces. CEJOR 19:177–189
Devroye L (1986) Non-uniform random variate generation. Springer, New York
Dyer M, Frieze A, Kannan R (1991) A random polynomial-time algorithm for approximating the volume of convex bodies. J Assoc Comput Mach 38:1–17
Fábián CI (2013) Computational aspects of risk-averse optimization in two-stage stochastic models. Stoch Program. E-Print Series 3-2013
Gassmann H, Deák I, Szántai T (2002) Computing multivariate normal probabilities: a new look. J Comput Graph Stat 11:920–949
Hammersley JM, Handscomb DC (1964) Monte Carlo methods. Methuen, London
Kannan R, Lovász L, Simonovits M (1997) Random walks and an \(O^*(n^5)\) volume algorithm for convex bodies. Random Struct Algorithms 11:1–50
Lovász L, Simonovits M (1992) On the randomized complexity of volume and diameter. In: Proceedings of 33rd IEEE annual symposium on foundations of Computer Science, pp 482–491
Lovász L, Simonovits M (1993) Random walks in a convex body and an improved volume algorithm. Random Struct Algorithms 4:359–412
Lovász L, Vempala S (2003) Simulated annealing in convex bodies and an \(O^*(n^4)\) volume algorithm. In: Proceedings of FOCS. pp 650–659
Lovász L, Vempala S (2006) Simulated annealing in convex bodies and an \(O^*(n^4)\) volume algorithm. J Comput Syst Sci 72:392–417
Lovász L, Deák I (2012) Computational results of an \(O^*(n^4)\) volume algorithm. Eur J Oper Res 216: 152–161
Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21:1087–1092
Mohácsi L (2013) On the application of recent techniques in computers, PhD dissertation. Corvinus University of Budapest
Romeijn E, Smith RL (1994) Simulated annealing for constrained global optimization. J Glob Optim 5:101–126
Rudelson M (1999) Random vectors in the isotropic position. J Funct Anal 164:60–72
Sanders J, Kandort E (2010) CUDA by example—an introduction to general purpose GPU programming. Addison Wesley, Reading
Simonovits M (2003) How to compute the volume in high dimensions. Math Program Ser B 97:337–374
Smith RL (1996) The hit and run sampler: a globally reaching Markov chain sampler for generating arbitrary multivariate distribution. In: Proceedings of 28th conference on winter simulation, pp 260–264
Zverovich V, Fábián CI, Ellison EFD, Mitra G (2012) A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition. Math Program Comput 4:211–238
Author information
Authors and Affiliations
Corresponding author
Additional information
Submitted to Central European Journal of Operational Research, this paper is based on a lecture given at the annual meeting of the Hungarian Operations Research Society, 2013, Balatonoszod.
Rights and permissions
About this article
Cite this article
Mohácsi, L., Deák, I. A parallel implementation of an \(O^*(n^4)\) volume algorithm. Cent Eur J Oper Res 23, 925–952 (2015). https://doi.org/10.1007/s10100-014-0354-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-014-0354-7