.png){kind=icon}
Return
Distributed Subgradient Projection Algorithm Over Directed Graphs
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2016.2615066.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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).
Keywords:
Constrained optimization
directed graphs
distributed optimization
projected subgradient
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
Observations on the Optical Deportment of the Atmosphere in Reference to the Phenomena of Putrefaction and Infection.png)
BMJOAAI
BMJIF0
OAAIShareSaveShareSaveEffect of ω-3 fatty acids on rectal mucosal cell proliferation in subjects at risk for colon cancerOAAI
OAAIShareSaveShareSaveShareSave
View more