Fetching the paper…
Reading the bibliography…
In this paper, we discuss distributed optimization over directed graphs, where doubly-stochastic weights cannot be constructed.
“The Hungarian method for the assignment problem,”
H. W. Kuhn, · 1955
Earlier work this paper cites.
“Distributed asynchronous deterministic and stochastic gradient optimization algorithms,”
J. Tsitsiklis, D. P. Bertsekas, and M. Athans, · 1986
Earlier work this paper cites.
Nonlinear programming
D. P. Bertsekas, · 1999
Earlier work this paper cites.
“Coordination of groups of mobile autonomous agents using nearest neighbor rules,”
A. Jadbabaie, J. Lin, and A. Morse, · 2003
Earlier work this paper cites.
“Gossip-based computation of aggregate information,”
D. Kempe, A. Dobra, and J. Gehrke, · 2003
Earlier work this paper cites.
“Distributed optimization in sensor networks,”
M. Rabbat and R. Nowak, · 2004
Earlier work this paper cites.
“Distributed subgradient methods for multi-agent optimization,”
A. Nedić and A. Ozdaglar, · 2009
Earlier work this paper cites.
“Consensus-based distributed support vector machines,”
P. A. Forero, A. Cano, and G. B. Giannakis, · 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 spectrum sensing for cognitive radio networks by exploiting sparsity,”
J. A. Bazerque and G. B. Giannakis, · 2010
Earlier work this paper cites.
“Discrete-time dynamic average consensus,”
M. Zhu and S. Martínez, · 2010
Earlier work this paper cites.
“Discrete-time dynamic average consensus,”
M. Zhu and S. Martínez, · 2010
Earlier work this paper cites.
“Weighted gossip: Distributed averaging using non-doubly stochastic matrices,”
F. Benezit, V. Blondel, P. Thiran, J. Tsitsiklis, and M. Vetterli, · 2010
Earlier work this paper cites.
“Distributed optimization and statistical learning via the alternating direction method of multipliers,”
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, · 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.
“Distributed alternating direction method of multipliers,”
E. Wei and A. Ozdaglar, · 2012
Earlier work this paper cites.
“Push-sum distributed dual averaging for convex optimization,”
K. I. Tsianos, S. Lawlor, and M. G. Rabbat, · 2012
Earlier work this paper cites.
“Average consensus on general strongly connected digraphs,”
K. Cai and H. Ishii, · 2012
Earlier work this paper cites.
“Sparse distributed learning based on diffusion adaptation,”
Paolo Di Lorenzo and Ali H Sayed, · 2013
Earlier work this paper cites.
“D-ADMM: A communication-efficient distributed algorithm for separable optimization,”
J. F. C. Mota, J. M. F. Xavier, P. M. Q. Aguiar, and M. Puschel, · 2013
Cited alongside, same era.
Matrix Analysis, 2 nd
R. A. Horn and C. R. Johnson, · 2013
Cited alongside, same era.
Matrix Analysis
R. A. Horn and C. R. Johnson, · 2013
Cited alongside, same era.
Introductory lectures on convex optimization: A basic course
Y. Nesterov, · 2013
Cited alongside, same era.
“On the linear convergence of the admm in decentralized consensus optimization,”
W. Shi, Q. Ling, K Yuan, G Wu, and W Yin, · 2014
Cited alongside, same era.
“Fast distributed gradient methods,”
D. Jakovetic, J. Xavier, and J. M. F. Moura, · 2014
Cited alongside, same era.
“ADD-OPT: Accelerated distributed directed optimization,”
C. Xi, R. Xin, and U. A. Khan, · 2017
Later among the works it cites.
“Achieving geometric convergence for distributed optimization over time-varying graphs,”
A. Nedić, A. Olshevsky, and W. Shi, · 2017
Later among the works it cites.
“Geometrically convergent distributed optimization with uncoordinated step-sizes,”
A. Nedić, A. Olshevsky, W. Shi, and C. A. Uribe, · 2017
Later among the works it cites.
“Multi-agent reinforcement learning via double averaging primal-dual optimization,”
H.-T. Wai, Z. Yang, Z. Wang, and M. Hong, · 2018
Closest in time.
“Distributed localization: A linear theory,”
S. Safavi, U. A. Khan, S. Kar, and J. M. F. Moura, · 2018
Closest in time.
“Exact diffusion for distributed optimization and learning - part I: Algorithm development,”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Diffusion adaptation over networks,”
A. H. Sayed, · 2014
Cited alongside, same era.
“On the convergence rate of swap-collide algorithm for simple task assignment,”
S. Safavi and U. A. Khan, · 2014
Cited alongside, same era.
“Extra: An exact first-order algorithm for decentralized consensus optimization,”
W. Shi, Q. Ling, G. Wu, and W Yin, · 2015
Cited alongside, same era.
“Distributed optimization over time-varying directed graphs,”
A. Nedić and A. Olshevsky, · 2015
Cited alongside, same era.
“On the convergence of decentralized gradient descent,”
K. Yuan, Q. Ling, and W. Yin, · 2016
Cited alongside, same era.
“Distributed nonconvex optimization over time-varying networks,”
P. Di Lorenzo and G. Scutari, · 2016
Cited alongside, same era.
K. Yuan, B. Ying, X. Zhao, and A. H. Sayed, · 2018
Closest in time.
“Exact diffusion for distributed optimization and learning - part II: Convergence analysis,”
K. Yuan, B. Ying, X. Zhao, and A. H. Sayed, · 2018
Closest in time.
“Harnessing smoothness to accelerate distributed optimization,”
G. Qu and N. Li, · 2018
Closest in time.
“Asynchronous subgradient-push,”
Mahmoud Assran and Michael Rabbat, · 2018
Closest in time.
“Asyspa: An exact asynchronous algorithm for convex optimization over digraphs,”
Jiaqi Zhang and Keyou You, · 2018
Closest in time.
Alex Olshevsky, Ioannis Ch Paschalidis, and Artin Spiridonoff, · 2018
Closest in time.
“A linear algorithm for optimization over directed graphs with geometric convergence,”
R. Xin and U. A. Khan, · 2018
Closest in time.
Ran Xin and Usman A Khan, · 2018
Closest in time.
“Linear convergence in optimization over directed graphs with row-stochastic matrices,”
C. Xi, V. S. Mai, R. Xin, E. Abed, and U. A. Khan, · 2018
Closest in time.
“Convergence of asynchronous distributed gradient methods over stochastic networks,”
J. Xu, S. Zhu, Y. Soh, and L. Xie, · 2018
Closest in time.
“Optimization over time-varying directed graphs with row and column-stochastic matrices,”
Fakhteh Saadatniaki, Ran Xin, and Usman A Khan, · 2018
Closest in time.
“Distributed finite-time least squares solver for network linear equations,”
Tao Yang, Jemin George, Jiahu Qin, Xinlei Yi, and Junfeng Wu, · 2018
Closest in time.
“Augmented distributed gradient methods for multi-agent optimization under uncoordinated constant stepsizes,”
J. Xu, S. Zhu, Y. C. Soh, and L. Xie, · 2060
Closest in time.
“Augmented distributed gradient methods for multi-agent optimization under uncoordinated constant stepsizes,”
J. Xu, Sj Zhu, Yj Cj Soh, and L. Xie, · 2060
Closest in time.