Hit-and-run mixes fast
From MaRDI portal
Publication:1968791
Recommendations
Cited in
(68)- A systematic approach for examining the impact of calibration uncertainty in disease modeling
- Fast MCMC sampling algorithms on polytopes
- Dimensional reduction for latent scores modeling using recursive integration
- Stochastic Billiards for Sampling from the Boundary of a Convex Set
- Hit-and-run from a corner
- Randomized interior point methods for sampling and optimization
- The symplectic geometry of closed equilateral random walks in 3-space
- Hit and Run Sampling from Tropically Convex Sets
- Hit-and-run for numerical integration
- Analysis of convergence rates of some Gibbs samplers on continuous state spaces
- Fast mixing of Metropolized Hamiltonian Monte Carlo: benefits of multi-step gradients
- Approximating income inequality dynamics given incomplete information: an upturned Markov chain model
- An analysis of a variation of hit-and-run for uniform sampling from general regions
- Hit-and-Run from a Corner
- Multiobjective interacting particle algorithm for global optimization
- On the computational complexity of MCMC-based estimators in large samples
- A Gibbs sampler on the \(n\)-simplex
- Comparison of hit-and-run, slice sampler and random walk Metropolis
- On the generation of random stable polynomials
- Approximating the tail of the Anderson-Darling distribution
- Volume of the steady-state space of financial flows in a monetary stock-flow-consistent model
- On the best case performance of hit and run methods for detecting necessary constraints
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- Pattern hit-and-run for sampling efficiently on polytopes
- The mixing time of the Dikin walk in a polytope -- a simple proof
- Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation
- Geodesic Walks in Polytopes
- Pattern discrete and mixed hit-and-run for global optimization
- Oracle lower bounds for stochastic gradient sampling algorithms
- Computational results of an \(O^{\ast }(n^{4})\) volume algorithm
- A generalized sampling approach for multilinear utility functions given partial preference information
- Randomized methods based on new Monte Carlo schemes for control and optimization
- Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
- On the generation of metric TSP instances with a large integrality gap by branch-and-cut
- Exploring stochasticity and imprecise knowledge based on linear inequality constraints
- Elicitation of criteria importance weights through the Simos method: a robustness concern
- On the mixing time of coordinate Hit-and-Run
- Comparison of Lasserre's measure-based bounds for polynomial optimization to bounds obtained by simulated annealing
- Rank constrained distribution and moment computations
- Computing and estimating the volume of the solution space of SMT(LA) constraints
- On the mixing time of Kac's walk and other high-dimensional Gibbs samplers with constraints
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- Log-concave sampling: Metropolis-Hastings algorithms are fast
- scientific article; zbMATH DE number 7236423 (Why is no real title available?)
- Faster mixing via average conductance
- Random sampling: billiard walk algorithm
- Research on probabilistic methods for control system design
- Hit and run as a unifying device
- Heuristics for selecting pair-wise elicitation questions in multiple criteria choice problems
- The accessibility of convex bodies and derandomization of the hit and run algorithm
- Efficient computation of the stochastic behavior of partial sum processes
- \(D\)-decomposition technique state-of-the-art
- Efficient sampling from time-varying log-concave distributions
- Lower Bounds for Hit-and-Run Direct Search
- Heat-bath random walks with Markov bases
- Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex
- John’s walk
- Generating a random collection of discrete joint probability distributions subject to partial information
- The interacting-particle algorithm with dynamic heating and cooling
- A Fast and Practical Method to Estimate Volumes of Convex Polytopes
- Asymptotic analysis of noisy fitness maximization, applied to metabolism \& growth
- Decision making with hierarchical credal sets
- Approximate spectral gaps for Markov chain mixing times in high dimensions
- Slow hit-and-run sampling
- Efficient Simulation of High Dimensional Gaussian Vectors
- Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems
- Multidimensional binary search for contextual decision-making
This page was built for publication: Hit-and-run mixes fast
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968791)
