Simulated Annealing: A Proof of Convergence

Authors:
V. Granville;M. Krivánek;J. P. Rasson
Affiliations:
-;-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1994

Citing 4
Cited 18

Cooling schedules for optimal annealing

Mathematics of Operations Research
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Simultaneous Parameter Estimation and Segmentation of Gibbs Random Fields Using Simulated Annealing

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Bayesian filter for a mixture model of noise in image remote sensing

Computational Statistics & Data Analysis

Stochastic Optimization Algorithms for Support Vector Machines Classification

Informatica
Parallel prototyping leads to better design results, more divergence, and increased self-efficacy

ACM Transactions on Computer-Human Interaction (TOCHI)
The effect of cooling functions on ensemble clustering using simulated annealing

Intelligent Data Analysis
Task allocation in mesh connected processors with local search meta-heuristic algorithms

ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Study of multiscale global optimization based on parameter space partition

Journal of Global Optimization
Improving FPGA placement with dynamically adaptive stochastic tunneling

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Implementation and validation of a new combined model for outdoor to indoor radio coverage predictions

EURASIP Journal on Wireless Communications and Networking
Unifying geometric, probabilistic, and potential field approaches to multi-robot deployment

International Journal of Robotics Research
Metaheuristic optimization: algorithm analysis and open problems

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Hierarchical parallel simulated annealing and its applications

ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Numerical treatment of nonlinear Emden---Fowler equation using stochastic technique

Annals of Mathematics and Artificial Intelligence
Feature reinforcement learning in practice

EWRL'11 Proceedings of the 9th European conference on Recent Advances in Reinforcement Learning
Romano: autonomous storage management using performance prediction in multi-tenant datacenters

Proceedings of the Third ACM Symposium on Cloud Computing
On the statistical determination of optimal camera configurations in large scale surveillance networks

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Computational optimization strategies for the simulation of random media and components

Computational Optimization and Applications
Simulation-based optimization for groups of cluster tools in semiconductor manufacturing using simulated annealing

Proceedings of the Winter Simulation Conference
Subtree selection in kernels for graph classification

International Journal of Data Mining and Bioinformatics
A novel particle filter with implicit dynamic model for irregular motion tracking

Machine Vision and Applications

Quantified Score

Hi-index	0.14

Visualization

Abstract

We prove the convergence of the simulated annealing procedure when the decision to change the current configuration is blind of the cost of the new configuration. In case of filtering binary images, the proof easily generalizes to other procedures, including that of Metropolis. We show that a function Q associated with the algorithm must be chosen as large as possible to provide a fast rate of convergence. The worst case (Q constant) is associated with the "blind" algorithm. On the other hand, an appropriate Q taking sufficiently high values yields a better rate of convergence than that of Metropolis procedure.