288 pp. per issue
6 x 9, illustrated
2014 Impact factor:

Neural Computation

August 1, 2005, Vol. 17, No. 8, Pages 1802-1819
(doi: 10.1162/0899766054026620)
© 2005 Massachusetts Institute of Technology
Dynamical Analysis of Continuous Higher-Order Hopfield Networks for Combinatorial Optimization
Article PDF (112.54 KB)

In this letter, the ability of higher-order Hopfield networks to solve combinatorial optimization problems is assessed by means of a rigorous analysis of their properties. The stability of the continuous network is almost completely clarified: (1) hyperbolic interior equilibria, which are unfeasible, are unstable; (2) the state cannot escape from the unitary hypercube; and (3) a Lyapunov function exists. Numerical methods used to implement the continuous equation on a computer should be designed with the aim of preserving these favorable properties. The case of nonhyperbolic fixed points, which occur when the Hessian of the target function is the null matrix, requires further study. We prove that these nonhyperbolic interior fixed points are unstable in networks with three neurons and order two. The conjecture that interior equilibria are unstable in the general case is left open.