What is it about?
Polynomial-time methods and fast, open-source implementations for approximating the volume of convex polyhedra in high dimension, within any required precision. This is the first such software in C++ and continues to be state-of-the-art.
Photo by RKTKN on Unsplash
Why is it important?
Polytope volume is key in several convex optimization and related problems. Our methods introduce original uniform sampling techniques and geometric random walks.
Read the Original
This page is a summary of: Practical Polytope Volume Approximation, ACM Transactions on Mathematical Software, December 2018, ACM (Association for Computing Machinery), DOI: 10.1145/3194656.
You can read the full text:
The following have contributed to this page