Answers are grounded in this paper and cite their sources.
In this brief, the quadratic problem with general linear constraints is reformulated using the Wolfe dual theory, and a very simple discrete-time recurrent neural network is proved to be able to solve it. Conditions that guarantee global convergence of this network to the constrained minimum are developed. The computational complexity of the method is analyzed, and experimental work is presented that shows its high efficiency.
No takes yet. Share an insight, caveat, or question.
M.J. Pérez-Ilzarbe (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: