Efficient geometric random walks for high-dimensional sampling from convex bodies
Abstract
High-dimensional sampling is a fundamental problem with many applications in science and engineering. Several problems are computationally hard for general dimension, and therefore, a great effort has been devoted to randomized approximation algorithms based on sampling that addresses those problems in polynomial time. In this thesis, we present algorithmic, complexity, and implementation results on the problem of sampling points from a log-concave distribution restricted to a convex polytope –the feasible region of a linear program– or a spectrahedron –the feasible region of a semidefinite program (SDP). We develop practical Multiphase Monte Carlo algorithms to address the problem of approximating the volume of a convex body, sampling from the flux space of metabolic networks in Systems Biology, and estimating the optimal solution of an SDP. The corresponding implementations scale up to thousands or hundred dimensions, depending on the problem. We use those methods and develop new geo ...
show more
![]() | Download full text in PDF format (11.5 MB)
(Available only to registered users)
|
All items in National Archive of Phd theses are protected by copyright.
|
Usage statistics
VIEWS
Concern the unique Ph.D. Thesis' views for the period 07/2018 - 07/2023.
Source: Google Analytics.
Source: Google Analytics.
ONLINE READER
Concern the online reader's opening for the period 07/2018 - 07/2023.
Source: Google Analytics.
Source: Google Analytics.
DOWNLOADS
Concern all downloads of this Ph.D. Thesis' digital file.
Source: National Archive of Ph.D. Theses.
Source: National Archive of Ph.D. Theses.
USERS
Concern all registered users of National Archive of Ph.D. Theses who have interacted with this Ph.D. Thesis. Mostly, it concerns downloads.
Source: National Archive of Ph.D. Theses.
Source: National Archive of Ph.D. Theses.




