Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.02634 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914598529007616 |
|---|---|
| author | Duan, Yuzhu Yang, Ziwen Duan, Xiaoming Zhu, Shanying |
| author_facet | Duan, Yuzhu Yang, Ziwen Duan, Xiaoming Zhu, Shanying |
| contents | Resource allocation is a fundamental problem in Industrial Internet of Things (IIoT) systems, in which devices work together under limited communication bandwidth to complete diverse tasks. This paper proposes a communication-efficient distributed optimization algorithm tailored for problems with coupled constraints. To tackle coupled constraints, we solve the problem via its dual counterpart, and develop a compressed version. Difference compression and dynamic scaling factors are then introduced to mitigate compression errors. We show that the proposed algorithm converges linearly for strongly convex and smooth objective functions. Numerical simulations validate the theoretical results and demonstrate the efficiency and robustness of the proposed algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_02634 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Communication-Efficient Distributed Optimization Algorithm for Problems with Coupling Constraints Duan, Yuzhu Yang, Ziwen Duan, Xiaoming Zhu, Shanying Optimization and Control Resource allocation is a fundamental problem in Industrial Internet of Things (IIoT) systems, in which devices work together under limited communication bandwidth to complete diverse tasks. This paper proposes a communication-efficient distributed optimization algorithm tailored for problems with coupled constraints. To tackle coupled constraints, we solve the problem via its dual counterpart, and develop a compressed version. Difference compression and dynamic scaling factors are then introduced to mitigate compression errors. We show that the proposed algorithm converges linearly for strongly convex and smooth objective functions. Numerical simulations validate the theoretical results and demonstrate the efficiency and robustness of the proposed algorithm. |
| title | A Communication-Efficient Distributed Optimization Algorithm for Problems with Coupling Constraints |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2512.02634 |