Distributed optimization and games over networks: a system theoretical perspective

Carnevale, Guido (2023) Distributed optimization and games over networks: a system theoretical perspective, [Dissertation thesis], Alma Mater Studiorum Università di Bologna. Dottorato di ricerca in Ingegneria biomedica, elettrica e dei sistemi, 35 Ciclo. DOI 10.48676/unibo/amsdottorato/10480.
Documenti full-text disponibili:
[img] Documento PDF (English) - Richiede un lettore di PDF come Xpdf o Adobe Acrobat Reader
Disponibile con Licenza: Creative Commons Attribution Non-commercial No Derivatives 4.0 (CC BY-NC-ND 4.0) .
Download (4MB)


Several decision and control tasks involve networks of cyber-physical systems that need to be coordinated and controlled according to a fully-distributed paradigm involving only local communications without any central unit. This thesis focuses on distributed optimization and games over networks from a system theoretical perspective. In the addressed frameworks, we consider agents communicating only with neighbors and running distributed algorithms with optimization-oriented goals. The distinctive feature of this thesis is to interpret these algorithms as dynamical systems and, thus, to resort to powerful system theoretical tools for both their analysis and design. We first address the so-called consensus optimization setup. In this context, we provide an original system theoretical analysis of the well-known Gradient Tracking algorithm in the general case of nonconvex objective functions. Then, inspired by this method, we provide and study a series of extensions to improve the performance and to deal with more challenging settings like, e.g., the derivative-free framework or the online one. Subsequently, we tackle the recently emerged framework named distributed aggregative optimization. For this setup, we develop and analyze novel schemes to handle (i) online instances of the problem, (ii) ``personalized'' optimization frameworks, and (iii) feedback optimization settings. Finally, we adopt a system theoretical approach to address aggregative games over networks both in the presence or absence of linear coupling constraints among the decision variables of the players. In this context, we design and inspect novel fully-distributed algorithms, based on tracking mechanisms, that outperform state-of-the-art methods in finding the Nash equilibrium of the game.

Tipologia del documento
Tesi di dottorato
Carnevale, Guido
Dottorato di ricerca
Settore disciplinare
Settore concorsuale
Parole chiave
Distributed Optimization, Consensus Optimization, Online Optimization, Derivative-Free Optimization, Distributed Aggregative Optimization, Personalized Optimization, Distributed Feedback Optimization, Aggregative Games, Distributed Equilibrium Seeking, Singular Perturbations.
Data di discussione
17 Marzo 2023

Altri metadati

Statistica sui download

Gestione del documento: Visualizza la tesi