Hit-and-Run from a Corner
From MaRDI portal
Recommendations
Cited in
(68)- \(D\)-decomposition technique state-of-the-art
- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- Computing and estimating the volume of the solution space of SMT(LA) constraints
- Statistics with set-valued functions: applications to inverse approximate optimization
- Improved mixing rates of directed cycles by added connection
- Hit-and-run mixes fast
- Oracle lower bounds for stochastic gradient sampling algorithms
- t-copula from the viewpoint of tail dependence matrices
- Optimal scaling of random-walk Metropolis algorithms on general target distributions
- Hit and run as a unifying device
- Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- On the computational complexity of MCMC-based estimators in large samples
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- Heat-bath random walks with Markov bases
- Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions
- The symplectic geometry of closed equilateral random walks in 3-space
- Randomized interior point methods for sampling and optimization
- Hit-and-run for numerical integration
- Multiobjective interacting particle algorithm for global optimization
- Random sampling: billiard walk algorithm
- A practical volume algorithm
- On sampling from multivariate distributions
- Discrete hit-and-run for sampling points from arbitrary distributions over subsets of integer hyperrectangles
- Stochastic Billiards for Sampling from the Boundary of a Convex Set
- Hit-and-run from a corner
- Lower Bounds for Hit-and-Run Direct Search
- The Markov chain Monte Carlo revolution
- Computational results of an \(O^{\ast }(n^{4})\) volume algorithm
- scientific article; zbMATH DE number 1281304 (Why is no real title available?)
- Pattern hit-and-run for sampling efficiently on polytopes
- Fast MCMC sampling algorithms on polytopes
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume
- The accessibility of convex bodies and derandomization of the hit and run algorithm
- Comparison of hit-and-run, slice sampler and random walk Metropolis
- An analysis of a variation of hit-and-run for uniform sampling from general regions
- Simple conditions for metastability of continuous Markov chains
- A Supervised Learning Approach Involving Active Subspaces for an Efficient Genetic Algorithm in High-Dimensional Optimization Problems
- Entanglement in bipartite quantum systems: Euclidean volume ratios and detectability by Bell inequalities
- Geodesic Walks in Polytopes
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
- Log-concave sampling: Metropolis-Hastings algorithms are fast
- Computation of expectations by Markov chain Monte Carlo methods
- Blocking Conductance and Mixing in Random Walks
- Convex set of quantum states with positive partial transpose analysed by hit and run algorithm
- Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
- On the mixing time of coordinate Hit-and-Run
- Hit and Run Sampling from Tropically Convex Sets
- Complexity results for MCMC derived from quantitative bounds
- John’s walk
- Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
- Pattern discrete and mixed hit-and-run for global optimization
- Tikhonov regularization as a nonparametric method for uncertainty quantification in aggregate data problems
- A practical algorithm for volume estimation based on billiard trajectories and simulated annealing
- Truncated log-concave sampling for convex bodies with reflective Hamiltonian Monte Carlo
- Rapid convergence of the unadjusted Langevin algorithm: isoperimetry suffices
- Resolving the mixing time of the Langevin algorithm to its stationary distribution for log-concave sampling
- Judicial support tool: finding the k most likely judicial worlds
- Integrated assessment of a robust Choquet integral preference model for efficient multicriteria decision support
- Sampling from convex sets with a cold start using multiscale decompositions
- Cone-based abstract interpretation for nonlinear positive invariant synthesis
- Convergence of hybrid slice sampling via spectral gap
- In-and-out: algorithmic diffusion for sampling convex bodies
- Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
- Optimal regularization for a data source
- Hit-and-run mixing via localization schemes
- Bridging chaos game representations and k-mer frequencies of DNA sequences
- Positivity of hit-and-run and related algorithms
This page was built for publication: Hit-and-Run from a Corner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470722)
