Distributed Event-Triggered Algorithm with Network Independent Step-Size for Constraint-Coupled Optimization Problems

In this study, we introduce a distributed algorithm that is specifically designed to address optimization problems featuring a decomposable objective function and equality constraints. To minimize the amount of communication required, we incorporate an event-triggered mechanism that enables information exchange only when variable values exceed predefined thresholds. Importantly, our proposed algorithm possesses a distinctive characteristic where the determination of step size is solely based on the properties of the objective function, regardless of the structure of the communication network. Even in situations where changes occur in the network structure, our algorithm remains valid without necessitating any updates to its step size. Assuming strong convexity and smoothness in local objective functions, along with appropriate event-triggered thresholds, our algorithm achieves a convergence rate that is linear. Several numerical experiments provide evidence supporting the effectiveness and superiority of our proposed approach.