A review of Hopfield neural networks for solving mathematical programming problems |
| |
Authors: | Ue-Pyng Wen Kuen-Ming Lan Hsu-Shih Shih |
| |
Institution: | 1. Department of Industrial Engineering & Engineering Management, National Tsing Hua University, Hsinchu 30013, Taiwan, ROC;2. Graduate Institute of Management Sciences, Tamkang University, Tamsui, Taipei 25137, Taiwan, ROC |
| |
Abstract: | The Hopfield neural network (HNN) is one major neural network (NN) for solving optimization or mathematical programming (MP) problems. The major advantage of HNN is in its structure can be realized on an electronic circuit, possibly on a VLSI (very large-scale integration) circuit, for an on-line solver with a parallel-distributed process. The structure of HNN utilizes three common methods, penalty functions, Lagrange multipliers, and primal and dual methods to construct an energy function. When the function reaches a steady state, an approximate solution of the problem is obtained. Under the classes of these methods, we further organize HNNs by three types of MP problems: linear, non-linear, and mixed-integer. The essentials of each method are also discussed in details. Some remarks for utilizing HNN and difficulties are then addressed for the benefit of successive investigations. Finally, conclusions are drawn and directions for future study are provided. |
| |
Keywords: | Hopfield neural networks Energy function Mathematical programming penalty function Lagrange multiplier Primal and dual functions |
本文献已被 ScienceDirect 等数据库收录! |
|