An efficient simplified neural network for solving linear and quadratic programming problems

We present a high-performance and efficiently simplified new neural network which improves the existing neural networks for solving general linear and quadratic programming problems. The network, having no need for parameter setting, results in a simple hardware requiring no analog multipliers, is shown to be stable and converges globally to the exact solution. Moreover, using this network we can solve both linear and quadratic programming problems and their duals simultaneously. High accuracy of the obtained solutions and low cost of implementation are among the features of this network. We prove the global convergence of the network analytically and verify the results numerically.