Abstract
This note investigates a network optimization problem in which a group of agents cooperate to minimize a global function under the practical constraint of finite bandwidth communication. We propose an adaptive encoding-decoding scheme to handle the quantization communication between agents. Based on this scheme, we develop a continuous-time quantized distributed primal-dual (QDPD) algorithm for the network optimization problem. Our algorithm achieves linear convergence to an exact optimal solution. Furthermore, we obtain the relationship between the communication bandwidth and the convergence rate. Finally, we use a distributed logistic regression problem to illustrate the effectiveness of our methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.