On logarithmic simulated annealing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1872 LNCS, Issue , 2000, Pages 301-314

  Albrecht, Andreas ^a,b   Wong, Chak Kuen ^b  

^a UNIVERSITY OF HERTFORDSHIRE   (United Kingdom)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

STOCHASTIC SYSTEMS;

AVERAGE-CASE ANALYSIS; CONFIGURATION SPACE; CONVERGENCE ANALYSIS; CONVERGENCE RATES; COOLING SCHEDULE; OPTIMUM SOLUTION; SIMULATED ANNEALING ALGORITHMS; STOCHASTIC ALGORITHMS;

SIMULATED ANNEALING;

EID: 84879072150     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44929-9_23     Document Type: Conference Paper

References (18)

1. S. Azencott (editor). Simulated Annealing: Parallelization Techniques. Wiley & Sons, New York, 1992.
2. E.H.L. Aarts and J.H.M. Korst. Simulated Annealing and Boltzmann Machines: A Stochastic Approach, Wiley & Sons, New York, 1989.
3. A. Albrecht, S.K. Cheung, K.S. Leung, and C.K. Wong. Stochastic Simulations of Two-Dimensional Composite Packings. J. of Computational Physics, 136(2):559-579, 1997.
4. O. Catoni. Rough Large Deviation Estimates for Simulated Annealing: Applications to Exponential Schedules. Annals of Probability, 20(3):1109-1146, 1992.
5. O. Catoni. Metropolis, Simulated Annealing, and Iterated Energy Transformation Algorithms: Theory and Experiments. J. of Complexity, 12(4):595-623, 1996.
6. V. Cerny. A Thermodynamical Approach to the Travelling Salesman Problem: An Eficient Simulation Algorithm. Preprint, Inst. of Physics and Biophysics, Comenius Univ., Bratislava, 1982
7. J. Optim. Theory Appl., 45:41-51, 1985).
8. B. Hajek. Cooling Schedules for Optimal Annealing. Mathem. Oper. Res., 13:311-329, 1988.
9. M. Kearns, M. Li, L. Pitt, and L.G. Valiant. Recent Results on Boolean Concept Learning. In Proc. 4th Int. Workshop on Machine Learning, pp. 337-352, 1987.
10. S. Kirkpatrick, C.D. Gelatt, Jr., and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220:671-680, 1983.
11. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller. Equation of State Calculations by Fast Computing Machines. J. of Chemical Physics, 21(6):1087-1092, 1953.
12. S. Rajasekaran and J.H. Reif. Nested Annealing: A Provable Improvement to Simulated Annealing. J. of Theoretical Computer Science, 99(1):157-176, 1992.
13. F. Romeo and A. Sangiovanni-Vincentelli. A Theoretical Framework for Simulated Annealing. Algorithmica, vol. 6, no. 3, pp. 302-345, 1991.
14. E. Seneta. Non-negative Matrices and Markov Chains. Springer-Verlag, New York, 1981.
15. A. Sinclair and M. Jerrum. Approximate Counting, Uniform Generation, and Rapidly Mixing Markov Chains. Information and Computation, 82:93-133, 1989.
16. A. Sinclair and M. Jerrum. Polynomial-Time Approximation Algorithms for the Ising Model. SIAM J. Comput., 22(5):1087-1116, 1993.
17. G. Sorkin. Eficient Simulated Annealing on Fractal Energy Landscapes. Algorithmica, 6:367-418, 1991.
18. K. Verbeurgt. Learning DNF under the Uniform Distribution in Quasi-Polynomial Time. In Proc. of the 3rd Annual Workshop on Computational Learning Theory, pp. 314-326, 1990.