2025/04/15 by Evagoras Makridis, Makridis, Evagoras, Gabriele Oliva +9
Computer Science · Engineering · #Advanced MIMO Systems Optimization #Distributed Control Multi-Agent Systems #FOS: Electrical engineering #Neural Networks Stability and Synchronization #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2504.10964
openalex publication_date 2025/04/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we address the distributed optimization problem over unidirectional networks with possibly time-invariant heterogeneous bounded transmission delays. In particular, we propose a modified version of the Accelerated Distributed Directed OPTimization (ADD-OPT) algorithm, herein called Robustified ADD-OPT (R-ADD-OPT), which is able to solve the distributed optimization problem, even when the communication links suffer from heterogeneous but bounded transmission delays. We show that if the gradient step-size of the R-ADD-OPT algorithm is within a certain range, which also depends on the maximum time delay in the network, then the nodes are guaranteed to converge to the optimal solution of the distributed optimization problem. The range of the gradient step-size that guarantees convergence can be computed a priori based on the maximum time delay in the network.