Abstract
In this paper, a delayed Lagrangian network is presented for solving quadratic programming problems. Based on some known results, the delay interval is determined to guarantee the asymptotic stability of the delayed neural network at the optimal solution. One simulation example is provided to show the effectiveness of the approach. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Liu, Q., Wang, J., & Cao, J. (2006). A delayed lagrangian network for solving quadratic programming problems with equality constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3971 LNCS, pp. 369–378). Springer Verlag. https://doi.org/10.1007/11759966_56
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
