A Simplified Dual Neural Network for Quadratic Programming With Its KWTA Application

Abstract

The design, analysis, and application of a new recurrent neural network for quadratic programming, called simplified dual neural network, are discussed. The analysis mainly concentrates on the convergence property and the computational complexity of the neural network. The simplified dual neural network is shown to be globally convergent to the exact optimal solution. The complexity of the neural network architecture is reduced with the number of neurons equal to the number of inequality constraints. Its application to k-winners-take-all (KWTA) operation is discussed to demonstrate how to solve problems with this neural network

DOI: 10.1109/TNN.2006.881046

Extracted Key Phrases

12 Figures and Tables

05020072008200920102011201220132014201520162017
Citations per Year

434 Citations

Semantic Scholar estimates that this publication has 434 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Liu2006ASD, title={A Simplified Dual Neural Network for Quadratic Programming With Its KWTA Application}, author={Shubao Liu and Jun Wang}, journal={IEEE Transactions on Neural Networks}, year={2006}, volume={17}, pages={1500-1510} }