DocumentCode :
2740536
Title :
Alternative simulation annealing processes for global optimization in neural networks
Author :
Guillerm, T.J. ; Cotter, N.E.
Author_Institution :
Utah Univ., Salt Lake City, UT
fYear :
1991
fDate :
8-14 Jul 1991
Abstract :
Summary form only given, as follows. The simulated annealing method is a tool for finding the global minima of a performance measure function. It is accomplished by constraining the probability distribution of the process to be a Gibbs distribution associated with the measure to be minimized. The only parameter upon which the convergence depends is the cooling schedule of the Gibbs temperature. Alternative distributions have been derived along with the cooling schedules for convergence to a global minimum. A global measure of performance was defined. It was concluded that an algorithm using simple multiplicative and additive functions will perform faster on a computer than an algorithm using more complicated functions
Keywords :
convergence; minimisation; neural nets; performance index; probability; simulated annealing; Gibbs distribution; Gibbs temperature; additive functions; convergence; cooling schedule; global minima; global optimization; multiplicative functions; neural networks; performance measure function; probability distribution; simulation annealing; Cities and towns; Convergence; Cooling; Intelligent networks; Neural networks; Probability distribution; Processor scheduling; Simulated annealing; Temperature dependence;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 1991., IJCNN-91-Seattle International Joint Conference on
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-0164-1
Type :
conf
DOI :
10.1109/IJCNN.1991.155568
Filename :
155568
Link To Document :
بازگشت