Global Convergence and Suppression of Spurious States of the Hopfield Neural Networks

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

Volumn 40, Issue 4, 1993, Pages 246-257

  Abe, Shigeo ^a  

^a HITACHI LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; LSI CIRCUITS; NUMERICAL ANALYSIS;

TRAVELING SALESMAN PROBLEM;

NEURAL NETWORKS;

EID: 0027585803     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/81.224297     Document Type: Article

References (28)

1. J. J. Hopfield, “Neural networks and physical systems with emergent collective computational abilities,” Proc. Nat. Acad. Sci. USA, vol. 79, pp. 2554–2558, Apr. 1982.
2. J. J. Hopfield, “Neurons with graded response have collective computational properties like those of two-state neurons,” Proc. Nat. Acad. Sci. USA, vol. 81, pp. 3088–3092, May 1984.
3. J. J. Hopfield and D. W. Tank, “Neural computation of decisions in optimization problems,” Bio. Cybern., vol. 52, pp. 141–152, 1985.
4. R. P. Lippman, “An introduction to computing with neural nets,” IEEE ASSP Magazine, pp. 4–22, Apr. 1987.
5. V. Wilson and G. S. Pawley, “On the stability of the TSP problem algorithm of Hopfield and Tank,” Bio. Cybern., vol. 58, pp. 63–70, 1988.
6. B. W. Lee and B. J. Sheu, “An investigation on local minima of Hopfield network for optimization circuits,” Proc. ICNN-88, pp. 45–51, July 1988.
7. D. J. Burr, “An improved elastic net method for the traveling salesman problem,” in Proc. ICNN-88, pp. 69–76.
8. G. J. Hueter, “Solution of the traveling salesman problem with an adaptive ring,” in Proc. ICNN-88, pp. 85–92.
9. H. Szu, “Fast TSP algorithm based on binary neuron output and analog neuron input using the zero-diagonal interconnect matrix and necessary and sufficient constraints of the permutation matrix,” in Proc. ICNN-88, pp. 259–266.
10. S. U. Hedge, J. L. Sweet, and W. B. Levy, “Determination of parameters in a Hopfield/Tank computational network,” in Proc. ICNN-88, pp. 291–298.
11. D. E. Van den Bout and T. K. Miller, “A traveling salesman objective function that works,” in Proc. ICNN-88, pp. 299–303.
12. E. Wacholder, J. Han, and R. C. Mann, “An extension of the Hopfield-Tank model for solution of the multiple traveling salesman problem, in Proc. ICNN-88, pp. 305–324.
13. J. Ramanujam and P. Sadayappan, “Optimization by neural networks,” in Proc. ICNN-88, pp. 325–332.
14. R. D. Brandt, Y. Wang, A. J. Laub, and S. K. Mitra, “Alternative networks for solving the traveling salesman problem and the list-matching problem,” in Proc. ICNN-88, pp. 333–340.
15. Y. S. Foo and Y. Takefuji, “Integer linear programming neural networks for job-shop scheduling,” in Proc. ICNN-88, pp. 341–348.
16. B. Kamgar-Parsi et al., “On problem solving with Hopfield neural networks,” Bio. Cybern., vol. 62, pp. 415–423, 1990.
17. E. Mjolsness, “Control of attention in neural networks,” in Proc. ICNN-87, vol. 2, pp. 567–574, 1987.
18. A. Culhane, M. Peckerar, and C. Marrian, “A neural net approach to discrete Hartley and Fourier transforms,” IEEE Trans. Circuits Svst., vol. 36, May 1989.
19. Y. Uesaka, “On the stability of neural network with the energy function induced from a real-valued function of binary variables,” IEICE Tech. Rep. PRU-86-6, June 1988.
20. S. Abe, “Theories on the Hopfield neural networks,” in Proc. IJCNN-89, vol. 1, pp. 557–564, June 1989.
21. S. Abe and J. Kawakami, “Theories on the Hopfield neural networks with inequality constraints,” in Proc. IJCNN-WASH-DC-90, vol. 1, pp. 349–352, Jan. 1990.
22. S. V. B. Aiyer, M. Niranjan, and F. Fallside, “A theoretical investigation into the performance of the Hopfield model,” IEEE Trans. Neural Networks vol. 1, 2, June 1990.
23. H. Date et al., “LSI module replacement methods using neural computation networks,” in Proc. IJCNN-89, vol. III pp. 831–836, June 1990.
24. J.-H. Li, A. N. Michel, and W. Porod, “Analysis and synthesis of a class of neural networks: Linear systems operating on a closed hypercube,” IEEE Trans. Circuits Syst., vol. CAS-36, pp. 1405–1422, Nov. 1989.
25. G. E. Hinton et al., “Boltzmann machines: Constraint satisfaction networks that learn,” CMU-CS-84-119, CMU, 1984.
26. H. Szu, “Fast simulated annealing,” Physics Letters A, vol. 122, pp. 157–162, June 1987.
27. Y. Akiyama et al., “Combinatorial optimization with Gaussian machines,” in Proc. IJCNN-89, vol. I, pp. 533–540, June 1989.
28. X. Xu and W. T. Tsai, “Effective neural algorithms for the traveling salesman problem,” Neural Networks, vol. 4, pp. 193–205, 1991.