.png){kind=icon}
返回
Quantized Primal-Dual Algorithms for Network Optimization With Linear Convergence
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2023.3266018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 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.
Keyword:
Convergence
Quantization (signal)
Bandwidth
Artificial neural networks
Estimation
Convex functions
Prediction algorithms
Distributed convex optimization
linear convergence rate
primal-dual algorithm
quantized communication
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
分享收藏A walking monitoring shoe system for simultaneous plantar-force measurement and gait-phase detection
PREAI
分享收藏Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity无强凸的分布原-对偶凸优化算法的指数收敛.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAI分享收藏Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints求解一般约束凸优化问题的连续时间分布次梯度算法OAAI
OAAI分享收藏Distributed Continuous-Time Optimization: Nonuniform Gradient Gains, Finite-Time Convergence, and Convex Constraint Set分布式连续时间优化: 非均匀梯度增益，有限时间收敛和凸约束集OAAI
OAAI分享收藏
查看更多内容