The following pages link to Hit-and-Run from a Corner (Q5470722):
Displaying 46 items.
- The symplectic geometry of closed equilateral random walks in 3-space (Q259598) (← links)
- Randomized interior point methods for sampling and optimization (Q259600) (← links)
- A practical volume algorithm (Q298158) (← links)
- Computational results of an \(O^{\ast }(n^{4})\) volume algorithm (Q421722) (← links)
- Pattern hit-and-run for sampling efficiently on polytopes (Q433826) (← links)
- Pattern discrete and mixed hit-and-run for global optimization (Q645554) (← links)
- On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
- \(D\)-decomposition technique state-of-the-art (Q1003077) (← links)
- Sampling from a log-concave distribution with projected Langevin Monte Carlo (Q1650786) (← links)
- Computing and estimating the volume of the solution space of SMT(LA) constraints (Q1659994) (← links)
- Statistics with set-valued functions: applications to inverse approximate optimization (Q1739037) (← links)
- Improved mixing rates of directed cycles by added connection (Q1741874) (← links)
- Oracle lower bounds for stochastic gradient sampling algorithms (Q2137007) (← links)
- \(t\)-copula from the viewpoint of tail dependence matrices (Q2146466) (← links)
- Optimal scaling of random-walk Metropolis algorithms on general target distributions (Q2196541) (← links)
- Hit and run as a unifying device (Q2197359) (← links)
- Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference (Q2332837) (← links)
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
- On the computational complexity of MCMC-based estimators in large samples (Q2388988) (← links)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- Heat-bath random walks with Markov bases (Q2407392) (← links)
- Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions (Q2443195) (← links)
- Hit-and-Run for Numerical Integration (Q2926241) (← links)
- Multiobjective Interacting Particle Algorithm for Global Optimization (Q2940537) (← links)
- On Sampling from Multivariate Distributions (Q3088131) (← links)
- Stochastic Billiards for Sampling from the Boundary of a Convex Set (Q3465938) (← links)
- The Markov chain Monte Carlo revolution (Q3623558) (← links)
- (Q4558208) (← links)
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume (Q4571932) (← links)
- The accessibility of convex bodies and derandomization of the hit and run algorithm (Q4604053) (← links)
- Comparison of hit-and-run, slice sampler and random walk Metropolis (Q4611278) (← links)
- Simple conditions for metastability of continuous Markov chains (Q4964782) (← links)
- A Supervised Learning Approach Involving Active Subspaces for an Efficient Genetic Algorithm in High-Dimensional Optimization Problems (Q5005000) (← links)
- Entanglement in bipartite quantum systems: Euclidean volume ratios and detectability by Bell inequalities (Q5051657) (← links)
- Geodesic Walks in Polytopes (Q5073522) (← links)
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization (Q5076724) (← links)
- (Q5214293) (← links)
- Computation of Expectations by Markov Chain Monte Carlo Methods (Q5256571) (← links)
- Blocking Conductance and Mixing in Random Walks (Q5295401) (← links)
- Convex set of quantum states with positive partial transpose analysed by hit and run algorithm (Q5347997) (← links)
- Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms (Q5743489) (← links)
- On the mixing time of coordinate Hit-and-Run (Q5886322) (← links)
- Hit and Run Sampling from Tropically Convex Sets (Q5978962) (← links)
- Complexity results for MCMC derived from quantitative bounds (Q6104001) (← links)
- John’s walk (Q6159393) (← links)
- Convergence of Gibbs sampling: coordinate hit-and-run mixes fast (Q6174808) (← links)
