DocumentCode :
2445430
Title :
Connectionist approach for global optimization
Author :
Babu, G. Phanendra ; Murty, M. Narasimha
Author_Institution :
Dept. of Comput. Sci. & Autom., Inst. of Sci., Bangalore, India
Volume :
7
fYear :
1994
fDate :
27 Jun-2 Jul 1994
Firstpage :
4672
Abstract :
A connectionist approach for global optimization is proposed. The standard function set is tested. Results obtained, in the case of large scale problems, indicate excellent scalability of the proposed approach
Keywords :
constraint theory; neural nets; optimisation; connectionist approach; constraint; function set; global optimization; large scale problems; neural networks; nonlinear programming; scalability; simulated annealing; Automation; Computer science; Indexing; Minimization; Neural networks; Optimization methods; Scalability; Stochastic processes; Temperature; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on
Conference_Location :
Orlando, FL
Print_ISBN :
0-7803-1901-X
Type :
conf
DOI :
10.1109/ICNN.1994.375030
Filename :
375030
Link To Document :
بازگشت