On the convergence of markovian stochastic algorithms with rapidly decreasing ergodicity rates
Author:
- 1 February 1999
- journal article
- Published by Taylor & Francis in Stochastics and Stochastic Reports
- Vol. 65 (3-4) , 177-228
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the Rate of Convergence of the Metropolis Algorithm and Gibbs Sampler by Geometric BoundsThe Annals of Applied Probability, 1994
- Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov ChainsCombinatorics, Probability and Computing, 1993
- The logarithmic sobolev inequality for discrete spin systems on a latticeCommunications in Mathematical Physics, 1992
- On sampling controlled stochastic approximationIEEE Transactions on Automatic Control, 1991
- Parametric Inference for imperfectly observed Gibbsian fieldsProbability Theory and Related Fields, 1989
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
- Stochastic Approximation Methods for Constrained and Unconstrained Systems1978
- Prescribing a System of Random Variables by Conditional DistributionsTheory of Probability & Its Applications, 1970
- The Description of a Random Field by Means of Conditional Probabilities and Conditions of Its RegularityTheory of Probability & Its Applications, 1968
- A Stochastic Approximation MethodThe Annals of Mathematical Statistics, 1951