Convergence Rate of Distributed ADMM over Networks
We propose a new distributed algorithm based on alternating direction method of multipliers (ADMM) to minimize sum of locally known convex functions using communication over a network. This optimization problem emerges in many applications in distributed machine learning and statistical estimation....
Main Authors: | Makhdoumi Kakhaki, Ali, Ozdaglar, Asuman E |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2019
|
Online Access: | https://hdl.handle.net/1721.1/121529 |
Similar Items
-
Graph balancing for distributed subgradient methods over directed graphs
by: Makhdoumi Kakhaki, Ali, et al.
Published: (2017) -
Convergence Analysis of Distributed Subgradient Methods over Random Networks
by: Lobel, Ilan, et al.
Published: (2010) -
Rate of Convergence of Learning in Social Networks
by: Lobel, Ilan, et al.
Published: (2011) -
Privacy-constrained network formation
by: Acemoglu, K. Daron, et al.
Published: (2020) -
Information provision in rating systems and traffic systems
by: Makhdoumi, Ali (Makhdoumi Kakhaki)
Published: (2019)