On constrained simulation and optimization by Metropolis chains
From MaRDI portal
Recommendations
- Stochastic approximation algorithms for constrained optimization via simulation
- Metamodel-based simulation optimization considering a single stochastic constraint
- ON THE CONVERGENCE OF METROPOLIS-TYPE RELAXATION AND ANNEALING WITH CONSTRAINTS
- Towards optimal scaling of Metropolis-coupled Markov chain Monte Carlo
- Exact bound for the convergence of metropolis chains
- An optimisation of the Metropolis algorithm for multibit Markov random fields
- Stochastic optimization methods with constraints
- scientific article; zbMATH DE number 953296
Cites work
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 53884 (Why is no real title available?)
- scientific article; zbMATH DE number 3519671 (Why is no real title available?)
- scientific article; zbMATH DE number 783366 (Why is no real title available?)
- scientific article; zbMATH DE number 4184603 (Why is no real title available?)
- Equation of state calculations by fast computing machines
- Markov chains for exploring posterior distributions. (With discussion)
- Monte Carlo sampling methods using Markov chains and their applications
- Optimization by simulated annealing
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
Cited in
(2)
This page was built for publication: On constrained simulation and optimization by Metropolis chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971384)