By Topic

Global optimization through time-varying cellular neural networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Gilli, M. ; Dipartimento di Elettronica, Politecnico di Torino, Italy ; Civalleri, P.P. ; Roska, T. ; Chua, L.O.

The global optimization properties of a cellular neural network (CNN) with a slowly varying slope of the output characteristic, are studied. It is shown that a two-cell CNN is able to find the global minimum of a quadratic function over the unit hypercube for any values of the input parameters. Then it is proved that if the dimension is higher than 2, then even the CNN described by the simplest one-dimensional space-invariant template [A1,A0,A 1] fails to find the global minimum in a subset of the parameter space. Finally through extensive simulations, it is shown that the CNN described by the above 3 element template works correctly within several parameter ranges, but that if the parameters are chosen according to a random algorithm, the error rate increases with the number of cells

Published in:

Cellular Neural Networks and their Applications, 1996. CNNA-96. Proceedings., 1996 Fourth IEEE International Workshop on

Date of Conference:

24-26 Jun 1996