Settling-time improvement in global convergence lagrangian networks
Document typeConference lecture
Rights accessOpen Access
In this brief, a modification of Lagrangian networks given in (Xia Y., 2003) is presented. This modification improves the settling time of the convergence of Lagrangian networks to a stationary point; which is the optimal solution to the nonlinear convex programming problem with linear equality constraints. This is important because, in many real-time applications where Lagrangian networks are used to find an optimal solution, such as in signal and image processing, this settling time is interpreted as the processing time. Simulation results applied to a quadratic optimization problem show that settling time is improved from about to 2000 to 20 seconds. Lyapunov theory was used to obtain our main result.
CitationAcho, L. Settling-time improvement in global convergence lagrangian networks. A: Second International Conference on Informatics in Control, Automation and Robotics. "ICINCO 2005". Barcelona: 2005, p. 315-318.