Computational results of an \(O^{\ast }(n^{4})\) volume algorithm
From MaRDI portal
Publication:421722
DOI10.1016/j.ejor.2011.06.024zbMath1242.90165OpenAlexW2052919733MaRDI QIDQ421722
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.06.024
simulationMarkov processescomputational resultsapplied probabilityMonte Carlo computationvolume algorithm
Related Items
Random sampling: billiard walk algorithm, A practical volume algorithm, A parallel implementation of an \(O^\ast(n^4)\) volume algorithm, A Fast and Practical Method to Estimate Volumes of Convex Polytopes, Computing and estimating the volume of the solution space of SMT(LA) constraints, Fast multivariate log-concave density estimation
Cites Work
- Random vectors in the isotropic position
- Simulated annealing for constrained global optimization
- How to compute the volume in high dimension?
- Hit-and-run mixes fast
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- The geometry of logconcave functions and sampling algorithms
- Random walks in a convex body and an improved volume algorithm
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Random walks and anO*(n5) volume algorithm for convex bodies
- Equation of State Calculations by Fast Computing Machines
- Simulated Annealing for Convex Optimization
- Hit-and-Run from a Corner
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
