Distributed optimization via dynamic event-triggered scheme with metric subregularity condition

In this paper, we present a continuous-time algorithm with a dynamic event-triggered communication (DETC) mechanism for solving a class of distributed convex optimization problems that satisfy a metric subregularity condition. The proposed algorithm addresses the challenge of limited bandwidth in multi-agent systems by utilizing a continuous-time optimization approach with DETC. Furthermore, we prove that the distributed event-triggered algorithm converges exponentially to the optimal set, even without strong convexity conditions. Finally, we provide a comparison example to demonstrate the efficiency of our algorithm in communication resource-saving.