Direct search for global minimum in neural network
Katsuo Toguchi · AIP conference proceedings · 2000
A new model of neural network is proposed and applied to the traveling salesman problem with 10 cities. It is shown that the network can find the shortest path in the ratio of 100% without being trapped in any local minima. The mechanism is investigated.