.png){kind=icon}
返回
Distributed Subgradient Algorithm for Multi-Agent Optimization With Dynamic Stepsize
.png){kind=icon}
PRE
AI
DOI：10.1109/JAS.2021.1003904.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider distributed convex optimization problems on multi-agent networks. We develop and analyze the distributed gradient method which allows each agent to compute its dynamic stepsize by utilizing the time-varying estimate of the local function value at the global optimal solution. Our approach can be applied to both synchronous and asynchronous communication protocols. Specifically, we propose the distributed subgradient with uncoordinated dynamic stepsizes (DS-UD) algorithm for synchronous protocol and the AsynDGD algorithm for asynchronous protocol. Theoretical analysis shows that the proposed algorithms guarantee that all agents reach a consensus on the solution to the multi-agent optimization problem. Moreover, the proposed approach with dynamic stepsizes eliminates the requirement of diminishing stepsize in existing works. Numerical examples of distributed estimation in sensor networks are provided to illustrate the effectiveness of the proposed approach.
Keyword:
Heuristic algorithms
Optimization
Convergence
Protocols
Linear programming
Gradient methods
Power system dynamics
Distributed optimization
dynamic stepsize
gradient method
multi-agent networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
19.2
论文数:
1.4K
被引数:
1.1W
机构
引用论文
Distributed Optimization Algorithms for Wide-Area Oscillation Monitoring in Power Systems Using Interregional PMU-PDC Architectures使用区域间pmu-pdc架构的电力系统广域振荡监测的分布式优化算法
OAAI
OAAI分享收藏Short-term strength training improves muscle quality and functional capacity of elderly women.png)
AGE
OAAI
AGEIF0
OAAI分享收藏分享收藏
查看更多内容