Fast simulated annealing in $\R^d$ and an application to maximum likelihood estimation

Details Fast simulated annealing in $\R^d$ and an application to maximum likelihood estimation Fast simulated annealing in $\R^d$ and an application to maximum likelihood estimation

2006-09-13

arxiv.org/abs/math/0609353v1

Mathematics

Probability

28 pages

Scientific paper

Using classical simulated annealing to maximise a function $\psi$ defined on a subset of $\R^d$, the probability $\p(\psi(\theta\_n)\leq \psi\_{\max}-\epsilon)$ tends to zero at a logarithmic rate as $n$ increases; here $\theta\_n$ is the state in the $n$-th stage of the simulated annealing algorithm and $\psi\_{\max}$ is the maximal value of $\psi$. We propose a modified scheme for which this probability is of order $n^{-1/3}\log n$, and hence vanishes at an algebraic rate. To obtain this faster rate, the exponentially decaying acceptance probability of classical simulated annealing is replaced by a more heavy-tailed function, and the system is cooled faster. We also show how the algorithm may be applied to functions that cannot be computed exactly but only approximated, and give an example of maximising the log-likelihood function for a state-space model.

Affiliated with

Also associated with

No associations

Rating

Fast simulated annealing in $\R^d$ and an application to maximum likelihood estimation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast simulated annealing in $\R^d$ and an application to maximum likelihood estimation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast simulated annealing in $\R^d$ and an application to maximum likelihood estimation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-554813