Convergence Analysis of Distributed Subgradient Methods over Random Networks
We consider the problem of cooperatively minimizing the sum of convex functions, where the functions represent local objective functions of the agents. We assume that each agent has information about his local function, and communicate with the other agents over a time-varying network topology. For...
| Main Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers,
2010-11-23T19:13:45Z.
|
| Subjects: | |
| Online Access: | Get fulltext |