Optimal search efficiency of Barker's algorithm with an exponential fitness function

DOI10.1007/S11590-013-0608-7MaRDI QIDQ2448147zbMATH OpenOpenAlexFDO

Authors Amor Menezes, Pierre T. Kabamba

Publication date 30 April 2014

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-013-0608-7

zbMATH Keywords

Markov chain Monte Carlomaximum entropysearch efficiencyselective generationstochastic optimization in dynamic environments

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Stochastic programming (90C15)

Recommendations

• Optimal scaling of MCMC beyond Metropolis
• Searching for efficient Markov chain Monte Carlo proposal kernels
• On the efficiency of adaptive MCMC algorithms
• Towards optimal scaling of Metropolis-coupled Markov chain Monte Carlo
• Optimal Markov monotone symmetric random search

Cites work

• A Mathematical Theory of Communication
• scientific article; zbMATH DE number 3181545 (Why is no real title available?)
• scientific article; zbMATH DE number 2117227 (Why is no real title available?)
• scientific article; zbMATH DE number 840151 (Why is no real title available?)
• Information Theory and Statistical Mechanics
• Markov Chains
• Mathematical theory of behavior - Individual and collective behavior of retardable elements
• Monte Carlo sampling methods using Markov chains and their applications
• Optimization by simulated annealing

Cited in

(3)

• Efficient search and responsiveness trade-offs in a Markov chain model of evolution in dynamic environments
• A fresh Take on ‘Barker Dynamics’ for MCMC
• Optimal scaling of MCMC beyond Metropolis

This page was built for publication: Optimal search efficiency of Barker's algorithm with an exponential fitness function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448147)