Global optimization through time-varying cellular neural networks

Abstract

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 [A/sub 1/,A/sub 0/,A/sub 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.