Pages that link to "Item:Q3100380"
From MaRDI portal
The following pages link to Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles (Q3100380):
Displaying 10 items.
- Pattern hit-and-run for sampling efficiently on polytopes (Q433826) (← links)
- Pattern discrete and mixed hit-and-run for global optimization (Q645554) (← links)
- Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work (Q2270192) (← links)
- Dimensional reduction for latent scores modeling using recursive integration (Q2320784) (← links)
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← 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)
- Single observation adaptive search for discrete and continuous stochastic optimization (Q2661541) (← links)
- (Q4789202) (← links)
- Some rapidly mixing hit-and-run samplers for latent counts in linear inverse problems (Q6589568) (← links)
