scientific article; zbMATH DE number 6982346
From MaRDI portal
Publication:4558208
zbMath1469.60240arXiv1710.08165MaRDI QIDQ4558208
Raaz Dwivedi, Bin Yu, Martin J. Wainwright, Yuansi Chen
Publication date: 21 November 2018
Full work available at URL: https://arxiv.org/abs/1710.08165
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods in Markov chains (60J22) Geometric probability and stochastic geometry (60D05) Monte Carlo methods (65C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items
On the mixing time of coordinate Hit-and-Run, Unnamed Item, Unnamed Item, Hit and Run Sampling from Tropically Convex Sets, A Gibbs Sampler for a Class of Random Convex Polytopes, Random generation of capacities and its application in comprehensive decision aiding, A latent slice sampling algorithm, Latent uniform samplers on multivariate binary spaces, John’s walk, Derivative-free optimization of a rapid-cycling synchrotron, Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: continuous dynamics, Relaxing the strong triadic closure problem for edge strength inference, Unadjusted Langevin algorithm for sampling a mixture of weakly smooth potentials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized interior point methods for sampling and optimization
- The mixing time of the Dikin walk in a polytope -- a simple proof
- A new algorithm for minimizing convex functions over convex sets
- Hit-and-run mixes fast
- Hilbert's metric and positive contraction mappings in a Banach space
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- The Volumetric Barrier for Semidefinite Programming
- Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming
- Randomized Algorithms for Matrices and Data
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Polytope Volume Computation
- Using Linear Programming to Decode Binary Linear Codes
- Handbook of Markov Chain Monte Carlo
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Random walks in a convex body and an improved volume algorithm
- Gaussian Hilbert Spaces
- Random walks and anO*(n5) volume algorithm for convex bodies
- Geodesic walks in polytopes
- Equation of State Calculations by Fast Computing Machines
- Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
- Stochastic localization + Stieltjes barrier = tight bound for log-Sobolev
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- Blocking Conductance and Mixing in Random Walks
- A Cubic Algorithm for Computing Gaussian Volume
- Hit-and-Run from a Corner
- Monte Carlo sampling methods using Markov chains and their applications
- Solving convex programs by random walks
