Extremum Seeking Tracking for Derivative-Free Distributed Optimization
In this article, we deal with a network of agents that want to cooperatively minimize the sum of local cost functions depending on a common decision variable. We consider the challenging scenario in which objective functions are unknown and agents have only access to local measurements of their local functions. We propose a novel distributed algorithm that combines a recent gradient tracking policy with an extremum seeking technique to estimate the global descent direction. The joint use of these two techniques results in a distributed optimization scheme that provides arbitrarily accurate solution estimates through the combination of Lyapunov and averaging analysis approaches with consensus theory. We perform numerical simulations in a personalized optimization framework to corroborate the theoretical results.
Authors
- Andrea Testa (ORCID: https://orcid.org/0000-0002-8118-5320)
- Giuseppe Notarstefano (ORCID: https://orcid.org/0000-0002-0906-7848)
- Guido Carnevale (ORCID: https://orcid.org/0000-0002-1190-4174)
- Nicola Mimmo (ORCID: https://orcid.org/0000-0002-8926-3733)
Institutions
- University of Bologna (IT)
Publication Details
- Journal
- IEEE Transactions on Control of Network Systems
- Published
- 2024-12-03
- DOI
- https://doi.org/10.1109/tcns.2024.3510368
- Citations
- 3
- Primary Topic
- Extremum Seeking Control Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.98
Funders
- Ministero degli Affari Esteri e della Cooperazione Internazionale