2025/05/13 by Kunpeng Zhang, Lei Xu, Zhang, Kunpeng +13
Computer Science · Engineering · #Advanced Wireless Network Optimization #Distributed Control Multi-Agent Systems #Energy Efficient Wireless Sensor Networks #FOS: Electrical engineering #FOS: Mathematics #Optimization and Control (math.OC) #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2505.08592
openalex publication_date 2025/05/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper considers distributed online nonconvex optimization with time-varying inequality constraints over a network of agents, where the nonconvex local loss and convex local constraint functions can vary arbitrarily across iterations. For a time-varying directed graph, we propose two distributed bandit online primal--dual algorithm with compressed communication to efficiently utilize communication resources in the one-point and two-point bandit feedback settings, respectively. To measure the performance of the proposed algorithms, we use a network regret metric grounded in the first-order optimality condition associated with the variational inequality. We show that the compressed algorithms establish sublinear network regret and cumulative constraint violation bounds. Moreover, the network cumulative constraint violation bounds are reduced under Slater's condition. Finally, a simulation example is presented to validate the theoretical results.