Pages that link to "Item:Q746262"
From MaRDI portal
The following pages link to Interacting multiple try algorithms with different proposal distributions (Q746262):
Displayed 15 items.
- Improving the acceptance in Monte Carlo simulations: sampling through intermediate states (Q350094) (← links)
- A multi-point Metropolis scheme with generic weight functions (Q449426) (← links)
- A generalized multiple-try version of the reversible jump algorithm (Q1623419) (← links)
- Efficient Gibbs sampling for Markov switching GARCH models (Q1659098) (← links)
- Multiple-try simulated annealing algorithm for global optimization (Q1721625) (← links)
- A parallel evolutionary multiple-try Metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions (Q2029093) (← links)
- An adaptive multiple-try Metropolis algorithm (Q2137054) (← links)
- Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm (Q2184405) (← links)
- On the flexibility of the design of multiple try Metropolis schemes (Q2259352) (← links)
- A multiple-try Metropolis-Hastings algorithm with tailored proposals (Q2319482) (← links)
- Issues in the multiple try Metropolis mixing (Q2358918) (← links)
- Adaptive Metropolis-Hastings sampling using reversible dependent mixture proposals (Q2631371) (← links)
- On the empirical efficiency of local MCMC algorithms with pools of proposals (Q2870715) (← links)
- Adaptive Component-Wise Multiple-Try Metropolis Sampling (Q3391230) (← links)
- Generalized multiple-point Metropolis algorithms for approximate Bayesian computation (Q5220747) (← links)