A simplified dual neural network for quadratic programming with its KWTA application

Shubao Liu, Jun Wang

Research output: Contribution to journalArticlepeer-review

206 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)1500-1510
Number of pages11
JournalIEEE Transactions on Neural Networks
Volume17
Issue number6
DOIs
Publication statusPublished - Nov 2006
Externally publishedYes

Keywords

  • Global stability
  • K-winners-take-all (KWTA)
  • Quadratic programming
  • Recurrent neural networks

Fingerprint

Dive into the research topics of 'A simplified dual neural network for quadratic programming with its KWTA application'. Together they form a unique fingerprint.

Cite this