Stability of primal–dual gradient dynamics and applications to network optimization

This paper considers dynamic laws that seek a saddle point of a function of two vector variables, by moving each in the direction of the corresponding partial gradient. This method has old roots in the classical work of Arrow, Hurwicz and Uzawa on convex optimization, and has seen renewed interest w...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Automatica (Oxford) 2010-12, Vol.46 (12), p.1974-1981
Hauptverfasser: Feijer, Diego, Paganini, Fernando
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper considers dynamic laws that seek a saddle point of a function of two vector variables, by moving each in the direction of the corresponding partial gradient. This method has old roots in the classical work of Arrow, Hurwicz and Uzawa on convex optimization, and has seen renewed interest with its recent application to resource allocation in communication networks. This paper brings other tools to bear on this problem, in particular Krasovskii’s method to find Lyapunov functions, and recently obtained extensions of the LaSalle invariance principle for hybrid systems. These methods are used to obtain stability proofs of these primal–dual laws in different scenarios, and applications to cross-layer network optimization are exhibited.
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2010.08.011