On the convergence rate of the simulated annealing algorithm

DOI10.1134/S0965542510010045zbMATH Open1224.65160MaRDI QIDQ2995797FDOQ2995797

Authors: A. S. Tikhomirov 

Publication date: 4 May 2011

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4186782
• scientific article; zbMATH DE number 4085428
• scientific article; zbMATH DE number 1759479
• scientific article; zbMATH DE number 878575
• Optimization by simulated annealing: a necessary and sufficient condition for convergence

zbMATH Keywords

convergenceglobal optimizationsimulated annealing algorithmrandom search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Mean square rates of convergence in the continuous time simulated annealing algorithm on \({\mathbb{R}}^ d\)
• On the efficiency of a continuous version of the simulated annealing algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Near-optimal solutions of convex semi-infinite programs via targeted sampling
• Convergence rate of a simulated annealing algorithm with noisy observations

This page was built for publication: On the convergence rate of the simulated annealing algorithm

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