Fetching the paper…
Reading the bibliography…
We study nonconvex distributed optimization in multiagent networks where the communications between nodes is modeled as a time-varying sequence of arbitrary digraphs.
D. P. Bertsekas,
1999
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.
D. S. Scherber and H. C. Papadopoulos, “Locally constructed algorithms for distributed computations in ad-hoc networks,” in
2004
Earlier work this paper cites.
V. D. Blondel, J. M. Hendrickx, A. Olshevsky, and J. N. Tsitsiklis, “Convergence in multiagent coordination, consensus, and flocking,” in
2005
Earlier work this paper cites.
L. Xiao, S. Boyd, and S. Lall, “A scheme for robust distributed sensor fusion based on average consensus,” in
2005
Earlier work this paper cites.
A. Nedić and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,”
2009
Earlier work this paper cites.
A. Nedić, A. Ozdaglar, and P. A. Parrilo, “Constrained consensus and optimization in multi-agent networks,”
2010
Earlier work this paper cites.
B. Gharesifard and J. Cortés, “When does a digraph admit a doubly stochastic adjacency matrix?” in
2010
Earlier work this paper cites.
K. Srivastava and A. Nedić, “Distributed asynchronous constrained stochastic optimization,”
2011
Earlier work this paper cites.
K. I. Tsianos and M. G. Rabbat, “Distributed consensus and optimization under communication delays,” in
2011
Earlier work this paper cites.
J. C. Duchi, A. Agarwal, and M. J. Wainwright, “Dual averaging for distributed optimization: convergence analysis and network scaling,”
2012
Cited alongside, same era.
K. I. Tsianos, S. Lawlor, and M. G. Rabbat, “Push-sum distributed dual averaging for convex optimization,” in
2012
Cited alongside, same era.
M. Zhu and S. Martínez, “An approximate dual subgradient algorithm for multi-agent non-convex optimization,”
2013
Cited alongside, same era.
P. Bianchi and J. Jakubowicz, “Convergence of a multi-agent projected stochastic gradient algorithm for non-convex optimization,”
2013
Cited alongside, same era.
B. Gharesifard and J. Cortés, “Distributed continuous-time convex optimization on weight-balanced digraphs,”
2014
Cited alongside, same era.
A. Nedic and A. Olshevsky, “Distributed optimization over time-varying directed graphs,”
2015
Later among the works it cites.
P. D. Lorenzo and G. Scutari, “Distributed nonconvex optimization over networks,” in
2015
Later among the works it cites.
P. D. Lorenzo and G. Scutari, “NEXT: in-network nonconvex optimization,”
2016
Closest in time.
Y. Sun and G. Scutari, “Distributed nonconvex optimization for sparse representation,” Purdue University, Tech. Rep., May 2016
2016
Closest in time.
——, “Distributed nonconvex optimization over time-varying networks,” in
2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. Scutari, F. Facchinei, P. Song, D. P. Palomar, and J.-S. Pang, “Decomposition by partial linearization: Parallel optimization of multi-agent systems,”
2014
Cited alongside, same era.
W. Shi, Q. Ling, G. Wu, and W. Yin, “Extra: An exact first-order algorithm for decentralized consensus optimization,”
2015
Cited alongside, same era.
T. Tatarenko and B. Touri, “Non-convex distributed optimization,”
2015
Cited alongside, same era.
F. Facchinei, G. Scutari, and S. Sagratella, “Parallel selective algorithms for nonconvex big data optimization,”
2015
Cited alongside, same era.
2016
Closest in time.
C. Xi and U. A. Khan, “ADD-OPT: Accelerated distributed directed optimization,”
2016
Closest in time.
G. Qu and N. Li, “Harnessing smoothness to accelerate distributed optimization,”
2016
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.