TY - GEN
T1 - Continuous-state simulated annealing algorithms
T2 - theory and application
AU - Gelfand, Saul B.
AU - Doerschuk, Peter C.
AU - Nahhas-Mohandes, Mohamed
PY - 1992
Y1 - 1992
N2 - Simulated annealing algorithms for optimization over continuous spaces come in two varieties: Markov chain algorithms and modified gradient algorithms. Unfortunately, there is a gap between the theory and the application of these algorithms: the convergence conditions cannot be practically implemented. In this paper we suggest a practical methodology for implementing the modified gradient annealing algorithms based on their relationship to the Markov chain algorithms.
AB - Simulated annealing algorithms for optimization over continuous spaces come in two varieties: Markov chain algorithms and modified gradient algorithms. Unfortunately, there is a gap between the theory and the application of these algorithms: the convergence conditions cannot be practically implemented. In this paper we suggest a practical methodology for implementing the modified gradient annealing algorithms based on their relationship to the Markov chain algorithms.
UR - https://www.scopus.com/pages/publications/0026991466
M3 - Conference contribution
AN - SCOPUS:0026991466
SN - 0819409391
T3 - Proceedings of SPIE - The International Society for Optical Engineering
SP - 235
EP - 245
BT - Proceedings of SPIE - The International Society for Optical Engineering
PB - Publ by Int Soc for Optical Engineering
ER -