Show simple item record

dc.contributor.authorToro, Dayanna
dc.contributor.authorLozano, José
dc.contributor.authorSánchez-Torres, Juan D.
dc.date.accessioned2019-01-09T16:48:37Z
dc.date.available2019-01-09T16:48:37Z
dc.date.issued2018-09
dc.identifier.citationD. T. Toro, J. M. Lozano and J. D. Sánchez-Torres, "An Augmented Lagrangian Neural Network for the Fixed-Time Solution of Linear Programming," 2018 15th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE), Mexico City, 2018, pp. 1-5. doi: 10.1109/ICEEE.2018.8533988es
dc.identifier.isbn978-1-5386-7033-0
dc.identifier.urihttp://hdl.handle.net/11117/5777
dc.descriptionIn this paper, a recurrent neural network is proposed using the augmented Lagrangian method for solving linear programming problems. The design of this neural network is based on the Karush-Kuhn-Tucker (KKT) optimality conditions and on a function that guarantees fixed-time convergence. With this aim, the use of slack variables allows transforming the initial linear programming problem into an equivalent one which only contains equality constraints. Posteriorly, the activation functions of the neural network are designed as fixed time controllers to meet KKT optimality conditions. Simulations results in an academic example and an application example show the effectiveness of the neural network.es
dc.language.isoenges
dc.publisherIEEEes
dc.rights.urihttp://quijote.biblio.iteso.mx/licencias/CC-BY-NC-2.5-MX.pdfes
dc.subjectNonlinear systemses
dc.subjectLyapunov stabilityes
dc.subjectConvex optimizationes
dc.subjectLinear programminges
dc.titleAn Augmented Lagrangian Neural Network for the Fixed-Time Solution of Linear Programminges
dc.typeinfo:eu-repo/semantics/conferencePaperes
rei.revisorCCE
rei.peerreviewedYeses


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record