.png){kind=icon}
返回
An Approximate Distributed Gradient Estimation Method for Networked System Optimization Under Limited Communications
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2018.2867154.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers the networked system optimization problem by cooperatively finding an approximately optimal solution to the overall network convex cost function, which is the sum of the individual cost functions of nodes (agents) in a networked system. A new distributed gradient descent algorithm is proposed based on the distributed estimation of the sum of gradients of individual cost functions using a consensus-type coordination algorithm. The proposed algorithm can address unknown directed communication topologies and only requires limited communications and information exchanges among nodes in the networked system. Under the assumption that the communication graph is strongly connected, the convergence of the proposed algorithm is rigorously analyzed. Simulation examples are presented to demonstrate the applicability and effectiveness of the proposed algorithm.
Keyword:
Cost function
Estimation
Topology
Approximation algorithms
Computational modeling
Resource management
Consensus
distributed gradient descent
limited communication
networked system optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
分享收藏Analysis of Flocking of Cooperative Multiple Inertial Agents via A Geometric Decomposition Technique
PREAI
分享收藏分享收藏Joint Optimization of Service Function Chaining and Resource Allocation in Network Function Virtualization网络功能虚拟化中服务功能链与资源分配的联合优化.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏
查看更多内容