返回
Distributed Subgradient Projection Algorithm Over Directed Graphs
DOI:10.1109/TAC.2016.2615066.png)
摘要
En 中文
We propose Directed-Distributed Projected Subgradient (D-DPS) to solve a constrained optimization problem over a multi-agent network, where the goal of agents is to collectively minimize the sum of locally known convex functions. Each agent in the network owns only its local objective function, constrained to a commonly known convex set. We focus on the circumstance when communications between agents are described by a directed network. The D-DPS combines surplus consensus to overcome the asymmetry caused by the directed communication network. The analysis shows the convergence rate to be O(ln k/root k).
Keyword:
Constrained optimization
directed graphs
distributed optimization
projected subgradient
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Observations on the Optical Deportment of the Atmosphere in Reference to the Phenomena of Putrefaction and Infection
BMJ
IF0
Effect of ω-3 fatty acids on rectal mucosal cell proliferation in subjects at risk for colon cancerΩ-3脂肪酸对结肠癌高危人群直肠黏膜细胞增殖的影响

