Fetching the paper…
Reading the bibliography…
In this paper, we consider distributed optimization problems over a multi-agent network, where each agent can only partially evaluate the objective function, and it is allowed to exchange messages with its immediate neighbors.
“Stochastic approximation methods,”
H. Robbins and S. Monro, · 1951
Earlier work this paper cites.
“Multiplier and gradient methods,”
M. R. Hestenes, · 1969
Earlier work this paper cites.
Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control
J. C. Spall, · 2003
Earlier work this paper cites.
“On the liu–floudas convexification of smooth programs,”
S. Zlobec, · 2005
Earlier work this paper cites.
“Consensus in ad hoc wsns with noisy links - part i: Distributed estimation of deterministic signals,”
I. Schizas, A. Ribeiro, and G. Giannakis, · 2008
Earlier work this paper cites.
“Coding with side information for rate-constrained consensus,”
M. E. Yildiz and A. Scaglione, · 2008
Earlier work this paper cites.
“Distributed subgradient methods for multi-agent optimization,”
A. Nedic and A. Ozdaglar, · 2009
Earlier work this paper cites.
“An approximate dual subgradient algorithm for multi-agent non-convex optimization,”
M. Zhu and S. Martinez, · 2010
Earlier work this paper cites.
“Optimal algorithms for online convex optimization with multi-point bandit feedback.,”
A. Agarwal, O. Dekel, and L. Xiao, · 2010
Earlier work this paper cites.
“Distributed sparse linear regression,”
G. Mateos, J. A. Bazerque, and G. B. Giannakis, · 2010
Earlier work this paper cites.
“Distributed asynchronous constrained stochastic optimization,”
K. Srivastava and A. Nedic, · 2011
Earlier work this paper cites.
“Distributed subgradient methods for convex optimization over random networks,”
I. Lobel and A. Ozdaglar, · 2011
Earlier work this paper cites.
“Decentralized multi-agent optimization via dual decomposition,”
H. Terelius, U. Topcu, and R. M. Murray, · 2011
Earlier work this paper cites.
“Random gradient-free minimization of convex functions,”
Y. Nesterov and V. Spokoiny, · 2011
Earlier work this paper cites.
“Distributed clustering using wireless sensor networks,”
P. A. Forero, A. Cano, and G. B. Giannakis, · 2011
Earlier work this paper cites.
“Dual averaging for distributed optimization: Convergence analysis and network scaling,”
J. C. Duchi, A. Agarwal, and M. J. Wainwright, · 2012
Earlier work this paper cites.
“High-dimensional regression with noisy and missing data: Provable guarantees with nonconvexity,”
P-L. Loh and M. Wainwright, · 2012
Cited alongside, same era.
“A non-convex distributed optimization framework and its application to wireless ad-hoc networks,”
G. Tychogiorgos, A. Gkelias, and K. K. Leung, · 2013
Cited alongside, same era.
“Convergence of a multi-agent projected stochastic gradient algorithm for non-convex optimization,”
P. Bianchi and J. Jakubowicz, · 2013
Cited alongside, same era.
“Stochastic first-and zeroth-order methods for nonconvex stochastic programming,”
S. Ghadimi and G. Lan, · 2013
Cited alongside, same era.
“Distributed delayed proximal gradient methods,”
M. Li, D. G. Andersen, and A. Smola, · 2013
Cited alongside, same era.
“Accelerating stochastic gradient descent using predictive variance reduction,”
“A unified algorithmic framework for block-structured optimization involving big data,”
M. Hong, M. Razaviyayn, Z.-Q. Luo, and J.-S. Pang, · 2016
Later among the works it cites.
Decentralized Learning for Wireless Communications and Networking
G. B. Giannakis, Q. Ling, G. Mateos, I.D. Schizas, and H. Zhu, · 2016
Later among the works it cites.
“A primal-dual method for conic constrained distributed optimization problems,”
N. S. Aybat and E. Y. Hamedani, · 2016
Later among the works it cites.
“Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems,”
M. Hong, Z.-Q. Luo, and M. Razaviyayn, · 2016
Later among the works it cites.
“Dqm: Decentralized quadratically approximated alternating direction method of multipliers,”
A. Mokhtari, W. Shi, Q. Ling, and A. Ribeiro, · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Johnson and T. Zhang, · 2013
Cited alongside, same era.
“Extra: An exact first-order algorithm for decentralized consensus optimization,”
W. Shi, Q. Ling, G. Wu, and W. Yin, · 2014
Cited alongside, same era.
“SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives,”
A. Defazio, F. Bach, and S. Lacoste-Julien, · 2014
Cited alongside, same era.
“Distributed optimization over time-varying directed graphs,”
A. Nedic and A. Olshevsky, · 2015
Cited alongside, same era.
“A proximal gradient algorithm for decentralized composite optimization,”
W. Shi, Q. Ling, G. Wu, and W. Yin, · 2015
Cited alongside, same era.
“Nonconvex alternating direction method of multipliers for distributed sparse principal component analysis,”
D. Hajinezhad and M. Hong, · 2015
Cited alongside, same era.
Stochastic gradient estimation, Handbook of simulation optimization
M. C. Fu, · 2015
Cited alongside, same era.
Y. Sun, G. Scutari, and D. Palomar, · 2016
Later among the works it cites.
M. Hong, · 2016
Later among the works it cites.
“Next: In-network nonconvex optimization,”
P. D. Lorenzo and G. Scutari, · 2016
Later among the works it cites.
“NESTT: A nonconvex primal-dual splitting method for distributed and stochastic optimization,”
D. Hajinezhad, M. Hong, T. Zhao, and Z. Wang, · 2016
Later among the works it cites.
“A comprehensive linear speedup analysis for asynchronous stochastic parallel optimization from zeroth-order to first-order,”
X. Lian, H. Zhang, C-J. Hsieh, Y. Huang, and J. Liu, · 2016
Later among the works it cites.
“A distributed semi-asynchronous algorithm for network traffic engineering,”
W-C. Liao, M. Hong, H. Farmanbar, and Z-Q. Luo, · 2017
Closest in time.
“On the convergence rate of incremental aggregated gradient algorithms,”
M. Gürbüzbalaban, A. Ozdaglar, and P. Parrilo, · 2017
Closest in time.
“Stochastic proximal gradient consensus over random networks,”
M. Hong and T. H. Chang, · 2017
Closest in time.
“Prox-PDA: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks,”
M. Hong, D. Hajinezhad, and M-M. Zhao, · 2017
Closest in time.
“Distributed linearized alternating direction method of multipliers for composite convex consensus optimization,”
N. S. Aybat, Z. Wang, T. Lin, and S. Ma, · 2018
Closest in time.
“On the information-adaptive variants of the ADMM: An iteration complexity perspective,”
X. Gao, B. Jiang, and S. Zhang, · 2018
Closest in time.