In this paper we propose a new control-oriented design technique to enhance the algorithmic performance of the distributed gradient tracking algorithm. We focus on a scenario in which agents in a network aim to cooperatively minimize the sum of convex, quadratic cost functions depending on a common decision variable. By leveraging a recent system-theoretical reinterpretation of the considered algorithmic framework as a closed-loop linear dynamical system, the proposed approach generalizes the diagonal gain structure associated to the existing gradient tracking algorithms. Specifically, we look for closed-loop gain matrices that satisfy the sparsity constraints imposed by the network topology, without however being necessarily diagonal, as in existing gradient tracking schemes. We propose a novel procedure to compute stabilizing sparse gain matrices by solving a set of nonlinear matrix inequalities, based on the solution of a sequence of approximate linear versions of such inequalities. Numerical simulations are presented showing the enhanced performance of the proposed design compared to existing gradient tracking algorithms.

Carnevale G., Bin M., Notarnicola I., Marconi L., Notarstefano G. (2020). Enhanced gradient tracking algorithms for distributed quadratic optimization via sparse gain design. Elsevier B.V. [10.1016/j.ifacol.2020.12.405].

Enhanced gradient tracking algorithms for distributed quadratic optimization via sparse gain design

Carnevale G.
;
Bin M.;Notarnicola I.;Marconi L.;Notarstefano G.
2020

Abstract

In this paper we propose a new control-oriented design technique to enhance the algorithmic performance of the distributed gradient tracking algorithm. We focus on a scenario in which agents in a network aim to cooperatively minimize the sum of convex, quadratic cost functions depending on a common decision variable. By leveraging a recent system-theoretical reinterpretation of the considered algorithmic framework as a closed-loop linear dynamical system, the proposed approach generalizes the diagonal gain structure associated to the existing gradient tracking algorithms. Specifically, we look for closed-loop gain matrices that satisfy the sparsity constraints imposed by the network topology, without however being necessarily diagonal, as in existing gradient tracking schemes. We propose a novel procedure to compute stabilizing sparse gain matrices by solving a set of nonlinear matrix inequalities, based on the solution of a sequence of approximate linear versions of such inequalities. Numerical simulations are presented showing the enhanced performance of the proposed design compared to existing gradient tracking algorithms.
2020
21st IFAC World Congress Berlin, Germany, 11–17 July 2020 Proceedings
2696
2701
Carnevale G., Bin M., Notarnicola I., Marconi L., Notarstefano G. (2020). Enhanced gradient tracking algorithms for distributed quadratic optimization via sparse gain design. Elsevier B.V. [10.1016/j.ifacol.2020.12.405].
Carnevale G.; Bin M.; Notarnicola I.; Marconi L.; Notarstefano G.
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S2405896320306959-main-1.pdf

accesso aperto

Tipo: Versione (PDF) editoriale
Licenza: Licenza per Accesso Aperto. Creative Commons Attribuzione - Non commerciale - Non opere derivate (CCBYNCND)
Dimensione 543.56 kB
Formato Adobe PDF
543.56 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/839359
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 5
social impact