The most efficient algorithm to sample from a log-concave distribution, that volesti supports is the Hamiltonian Monte Carlo with leapfrog...
Counting linear extensions with volume computation
reyan_ahmed
In this project, we will implement different algorithms to count linear extensions approximately. In the problem of counting the linear extensions,...
Memory allocation in facet redundancy removal in dingo
Haris Zafeiropoulos
Sampling and volume computation of convex polytopes is a challenging computational problem with many applications in inference from linear...
Support for new sampling methods and new model formats in dingo
KONSTANTINOS PALLIKARIS
Package dingo is a python package that analyzes metabolic networks. It relies on high dimensional sampling with Markov Chain Monte Carlo (MCMC)...
Randomized SDP solver with Riemannian Hamiltonian Monte Carlo
Ioannis Iakovidis
The relationship between sampling and optimization has gained increasing interest in recent years. A great number of optimization algorithms that are...
Sampling correlation matrices
Huu Phuoc Le
We study the sampling of correlation matrices from a given probability density, which has applications in various scientific, engineering and...