.png){kind=icon}
Return
Asynchronous Gossip-Based Random Projection Algorithms Over Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2015.2460051.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider a distributed constrained convex optimization problem over a multi-agent (no central coordinator) network. We propose a completely decentralized and asynchronous gossip-based random projection (GRP) algorithm that solves the distributed problem using only local communications and computations. We analyze the convergence properties of the algorithm for a diminishing and a constant stepsize which are uncoordinated among agents. For a diminishing stepsize, we prove that the iterates of all agents converge to the same optimal point with probability 1. For a constant stepsize, we establish an error bound on the expected distance from the iterates of the algorithm to the optimal point. We also provide simulation results on a distributed robust model predictive control problem.
Keywords:
Gossip-based random projection (GRP)
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
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more