Distributed subgradient projection algorithm for convex optimization
By Sundhar Srinivasan Ram, Angelia Nedić, Venugopal V. Veeravalli. 2009
56 citations recorded by the source corpus.
Subfields: Computational Mechanics, Computational Theory and Mathematics, Computer Networks and Communications
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
In Computational Theory and Mathematics
In Computer Networks and Communications
Citations in the corpus
- Asynchronous Decentralized Parallel Stochastic Gradient Descent (2017, neutral): “The subgradient version was considered in Nedic and Ozdaglar [2009], Ram et al. [2009].”
- Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descent (2017, methodology): “Although decentralized algorithms have been studied as consensus optimization in the control community and used for preserving data privacy [Ram et al., 2009a, Yan et al., 2013, Yuan et al., 2016], for the application scenario where only the decentralized network is available, it is still an open…”
- Optimal Distributed Online Prediction (2011, background): “More recent works include Ram et al. (2009); Nedi´c & Ozdaglar (2009); Zinkevich et al. (2010); Duchi et al. (2010).”
- Towards Decentralized Deep Learning with Differential Privacy (2019, background): “Many decentralized algorithms aim at solving distributed consensus problems [15][16][17], which is also the goal of our paper.”