A class of finite-time dual neural networks for solving quadratic programming problems and its \(k\)-winners-take-all application (Q901342): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q45305798, #quickstatements; #temporary_batch_1706897434465 |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.neunet.2012.12.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034877773 / rank | |||
Normal rank | |||
Latest revision as of 21:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of finite-time dual neural networks for solving quadratic programming problems and its \(k\)-winners-take-all application |
scientific article |
Statements
A class of finite-time dual neural networks for solving quadratic programming problems and its \(k\)-winners-take-all application (English)
0 references
11 January 2016
0 references
recurrent neural network
0 references
quadratic programming
0 references
finite-time convergence
0 references
\(k\) winners take all (\(k\)-WTA)
0 references
stability
0 references
