DocumentCode
3504853
Title
A universal optimisation network
Author
Harth, E. ; Kalogeropoulos, T. ; Pandya, A.S.
Author_Institution
Dept. of Phys., Syracuse Univ., NY, USA
fYear
1988
fDate
4-7 Nov 1988
Firstpage
97
Lastpage
107
Abstract
An optimization algorithm was developed that causes the simultaneous convergence of a large number of parameters determining the value of a scaler cost function. The procedure is iterative and stochastic, and tends to avoid local extrema. It is shown that the number of iterations required for convergence of the cost function increases linearly with the number of parameters. The procedure is universal in that it can be applied without modification to a large variety of optimization problems. Several examples are discussed, and results of computer simulations are presented
Keywords
optimisation; computer simulations; iterative procedure; local extrema avoidance; optimization algorithm; optimization problems; parameters convergence; scaler cost function; stochastic procedure; universal optimisation network; Business; Computer simulation; Convergence; Cost function; Dynamic range; Land surface temperature; Optimization methods; Simulated annealing; Stochastic resonance; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Biomedical Engineering., Proceedings of a Special Symposium on Maturing Technologies and Emerging Horizons in
Conference_Location
New Orleans, LA
Type
conf
DOI
10.1109/MTEHBE.1988.26407
Filename
26407
Link To Document