Fetching the paper…
Reading the bibliography…
This papers studies multi-agent (convex and \emph{nonconvex}) optimization over static digraphs.
J. N. Tsitsiklis, D. P. Bertsekas, and M. Athans, “Distributed asynchronous deterministic and stochastic gradient optimization algorithms,”
1986
Earlier work this paper cites.
D. P. Bertsekas and J. N. Tsitsiklis,
1989
Earlier work this paper cites.
1990
Earlier work this paper cites.
S. M. Kay,
1993
Earlier work this paper cites.
T. S. Rappaport,
2002
Earlier work this paper cites.
D. Kempe, A. Dobra, and J. Gehrke, “Gossip-based computation of aggregate information,” in
2003
Earlier work this paper cites.
A. Nedić and A. Ozdaglar, “Convergence rate for consensus with delays,”
2010
Earlier work this paper cites.
L. Zhao, M. Mammadov, and J. Yearwood, “From convex to nonconvex: a loss function analysis for binary classification,” in
2010
Earlier work this paper cites.
A. Nedić, “Asynchronous broadcast-based convex optimization over a network,”
2011
Earlier work this paper cites.
F. Niu, B. Recht, C. Re, and S. J. Wright, “Hogwild: a lock-free approach to parallelizing stochastic gradient descent,” in
2011
Earlier work this paper cites.
——, “Distributed consensus and optimization under communication delays,” in
2011
Earlier work this paper cites.
K. I. Tsianos and M. G. Rabbat, “Distributed dual averaging for convex optimization under communication delays,” in
2012
Earlier work this paper cites.
F. Iutzeler, P. Bianchi, P. Ciblat, and W. Hachem, “Asynchronous distributed optimization using a randomized alternating direction method of multipliers,” in
2013
Earlier work this paper cites.
E. Wei and A. Ozdaglar, “On the
2013
Earlier work this paper cites.
P. Lin and W. Ren, “Constrained consensus in unbalanced networks with communication delays,”
2013
Earlier work this paper cites.
X. Zhao and A. H. Sayed, “Asynchronous adaptation and learning over networks–Part I/Part II/Part III: Modeling and stability analysis/Performance analysis/Comparison analysis,”
2015
Earlier work this paper cites.
J. Liu and S. J. Wright, “Asynchronous stochastic coordinate descent: Parallelism and convergence properties,”
2015
Cited alongside, same era.
X. Lian, Y. Huang, Y. Li, and J. Liu, “Asynchronous parallel stochastic gradient for nonconvex optimization,” in
2015
Cited alongside, same era.
H. Wang, X. Liao, T. Huang, and C. Li, “Cooperative distributed optimization in multiagent networks with delays,”
2015
Cited alongside, same era.
P. Di Lorenzo and G. Scutari, “Distributed nonconvex optimization over networks,” in
2015
Cited alongside, same era.
Z. Peng, Y. Xu, M. Yan, and W. Yin, “Arock: an algorithmic framework for asynchronous parallel coordinate updates,”
2016
Cited alongside, same era.
I. Notarnicola and G. Notarstefano, “Asynchronous distributed optimization via randomized dual proximal gradient,”
2017
Later among the works it cites.
J. Xu, S. Zhu, Y. C. Soh, and L. Xie, “Convergence of asynchronous distributed gradient methods over stochastic networks,”
2017
Later among the works it cites.
2017
Later among the works it cites.
A. Nedić, A. Olshevsky, and W. Shi, “Achieving geometric convergence for distributed optimization over time-varying graphs,”
2017
Later among the works it cites.
N. Bof, R. Carli, and L. Schenato, “Average consensus with asynchronous updates and unreliable communication,” in
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
J. Li, G. Chen, Z. Dong, and Z. Wu, “Distributed mirror descent method for multi-agent optimization with delay,”
2016
Cited alongside, same era.
P. Lin, W. Ren, and Y. Song, “Distributed multi-agent optimization subject to nonidentical constraints and communication delays,”
2016
Cited alongside, same era.
P. Di Lorenzo and G. Scutari, “Next: In-network nonconvex optimization,”
2016
Cited alongside, same era.
C. N. Hadjicostis, N. H. Vaidya, and A. D. Dominguez-Garcia, “Robust distributed average consensus via exchange of running sums,”
2016
Cited alongside, same era.
Y. Sun, G. Scutari, and D. Palomar, “Distributed nonconvex multiagent optimization over time-varying networks,” in
2016
Cited alongside, same era.
S. Kumar, R. Jain, and K. Rajawat, “Asynchronous optimization over heterogeneous networks via consensus admm,”
2017
Cited alongside, same era.
L. Cannelli, F. Facchinei, and G. Scutari, “Multi-agent asynchronous nonconvex large-scale optimization,” in
2017
Later among the works it cites.
D. Dua and C. Graff, “UCI machine learning repository,” 2017. [Online]. Available:
2017
Later among the works it cites.
Y. Tian, Y. Sun, and G. Scutari, “Asy-sonata: Achieving linear convergence for distributed asynchronous optimization,” in
2018
Closest in time.
——, “Asy-sonata: Achieving geometric convergence for distributed asynchronous optimization,”
2018
Closest in time.
M. Assran and M. Rabbat, “Asynchronous subgradient-push,”
2018
Closest in time.
2018
Closest in time.
L. Cannelli, F. Facchinei, V. Kungurtsev, and G. Scutari, “Asynchronous parallel algorithms for nonconvex optimization,”
2019
Closest in time.
G. Scutari and Y. Sun, “Distributed nonconvex constrained optimization over time-varying digraphs,”
2019
Closest in time.
2019
Closest in time.
J. Xu, S. Zhu, Y. C. Soh, and L. Xie, “Augmented distributed gradient methods for multi-agent optimization under uncoordinated constant stepsizes,” in
2060
Closest in time.