A simple and high performance neural network for quadratic programming problems
Applied Mathematics and Computation
An Extended Projection Neural Network for Constrained Optimization
Neural Computation
IEEE Transactions on Neural Networks
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A new neural network for solving linear and quadratic programming problems
IEEE Transactions on Neural Networks
A novel neural network for nonlinear convex programming
IEEE Transactions on Neural Networks
A Simplified Dual Neural Network for Quadratic Programming With Its KWTA Application
IEEE Transactions on Neural Networks
Solving Quadratic Programming Problems by Delayed Projection Neural Network
IEEE Transactions on Neural Networks
IEEE Transactions on Neural Networks
Constrained Least Absolute Deviation Neural Networks
IEEE Transactions on Neural Networks
IEEE Transactions on Neural Networks
IEEE Transactions on Neural Networks
IEEE Transactions on Neural Networks
Hi-index | 0.01 |
A new recurrent neural network is proposed for solving quadratic and linear programming problems, which is derived from two salient existing neural networks. One of the predecessors has lower structural complexity but were not shown to be capable of solving degenerate QP problems including LP problems while the other does not have this limitation but has higer structural complexity. The proposed model inherits the merits of both models and thus serves as a competitive alternative for solving QP and LP problems. Numerical simulations are provided to demonstrate the performance of the model and validate the theoretical results.