Fetching the paper…
Reading the bibliography…
The paper considers distributed gradient flow (DGF) for multi-agent nonconvex optimization.
1902
Earlier work this paper cites.
1907
Earlier work this paper cites.
1907
Earlier work this paper cites.
E. A. Coddington and N. Levinson, Theory of Ordinary Differential Equations . Tata McGraw-Hill Education, 1955
1955
Earlier work this paper cites.
W. Rudin, Principles of Mathematical Analysis . McGraw-Hill New York, 1964
1964
Earlier work this paper cites.
F. R. K. Chung, Spectral Graph Theory . American Mathematical Society, 1997, no. 92
1997
Earlier work this paper cites.
A. Jadbabaie, J. Lin, and A. S. Morse, “Coordination of groups of mobile autonomous agents using nearest neighbor rules,” IEEE Transactions on automatic control , vol. 48, no. 6, pp. 988–1001, 2003
2003
Earlier work this paper cites.
2003
Earlier work this paper cites.
M. Benaïm, J. Hofbauer, and S. Sorin, “Stochastic approximations and differential inclusions,” SIAM Journal on Control and Optimization , vol. 44, no. 1, pp. 328–348, 2005
2005
Earlier work this paper cites.
C. Chicone, Ordinary Differential Equations with Applications . Springer Science & Business Media, 2006, vol. 34
2006
Earlier work this paper cites.
F. H. Clarke, Y. S. Ledyaev, R. J. Stern, and P. R. Wolenski, Nonsmooth Analysis and Control Theory . Springer Science & Business Media, 2008, vol. 178
2008
Earlier work this paper cites.
J. Cortes, “Discontinuous dynamical systems,” IEEE Control systems magazine , vol. 28, no. 3, pp. 36–73, 2008
2008
Earlier work this paper cites.
A. Nedic and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control , vol. 54, no. 1, pp. 48–61, 2009
2009
Earlier work this paper cites.
A. G. Dimakis, S. Kar, J. M. Moura, M. G. Rabbat, and A. Scaglione, “Gossip algorithms for distributed signal processing,” Proceedings of the IEEE , vol. 98, no. 11, pp. 1847–1864, 2010
2010
Earlier work this paper cites.
A. Nedic, A. Ozdaglar, and P. A. Parrilo, “Constrained consensus and optimization in multi-agent networks,” IEEE Transactions on Automatic Control , vol. 55, no. 4, pp. 922–938, 2010
2010
Earlier work this paper cites.
M. Zhu and S. Martínez, “On distributed convex optimization under inequality and equality constraints,” IEEE Transactions on Automatic Control , vol. 57, no. 1, pp. 151–164, 2011
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,” IEEE Transactions on Automatic control , vol. 57, no. 3, pp. 592–606, 2011
2011
Earlier work this paper cites.
M. Zhu and S. Martínez, “An approximate dual subgradient algorithm for multi-agent non-convex optimization,” IEEE Transactions on Automatic Control , vol. 58, no. 6, pp. 1534–1539, 2012
2012
Earlier work this paper cites.
J.-P. Aubin and A. Cellina, Differential Inclusions: Set-Valued Maps and Viability Theory . Springer Science & Business Media, 2012, vol. 264
2012
Earlier work this paper cites.
J. Chen and A. H. Sayed, “Diffusion adaptation strategies for distributed optimization and learning over networks,” IEEE Transactions on Signal Processing , vol. 60, no. 8, pp. 4289–4305, 2012
2012
Earlier work this paper cites.
P. Bianchi and J. Jakubowicz, “Convergence of a multi-agent projected stochastic gradient algorithm for non-convex optimization,” IEEE Transactions on Automatic Control , vol. 58, no. 2, pp. 391–405, 2012
2012
Cited alongside, same era.
M. W. Hirsch, Differential Topology . Springer Science & Business Media, 2012, vol. 33
2012
Cited alongside, same era.
S. Kar, J. M. Moura, and H. V. Poor, “Distributed linear parameter estimation: Asymptotically efficient adaptive strategies,” SIAM Journal on Control and Optimization , vol. 51, no. 3, pp. 2200–2229, 2013
2013
Cited alongside, same era.
T. Kato, Perturbation Theory for Linear Operators . Springer Science & Business Media, 2013, vol. 132
2013
Cited alongside, same era.
B. Gharesifard and J. Cortés, “Distributed continuous-time convex optimization on weight-balanced digraphs,” IEEE Transactions on Automatic Control , vol. 59, no. 3, pp. 781–786, 2013
S. Liang, X. Zeng, and Y. Hong, “Distributed nonsmooth optimization with coupled inequality constraints via modified lagrangian function,” IEEE Transactions on Automatic Control , vol. 63, no. 6, pp. 1753–1759, 2017
2017
Later among the works it cites.
C. Jin, R. Ge, P. Netrapalli, S. M. Kakade, and M. I. Jordan, “How to escape saddle points efficiently,” in Proceedings of the International Conference on Machine Learning , 2017, pp. 1724–1732
2017
Later among the works it cites.
S. S. Du, C. Jin, J. D. Lee, M. I. Jordan, A. Singh, and B. Poczos, “Gradient descent can take exponential time to escape saddle points,” in Proceedings of Advances in Neural Information Processing Systems , 2017, pp. 1067–1077
2017
Later among the works it cites.
T. Tatarenko and B. Touri, “Non-convex distributed optimization,” IEEE Transactions on Automatic Control , vol. 62, no. 8, pp. 3744–3757, 2017
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…
2013
Cited alongside, same era.
M. Shub, Global Stability of Dynamical Systems . Springer Science & Business Media, 2013
2013
Cited alongside, same era.
L. Perko, Differential Equations and Dynamical Systems . Springer Science & Business Media, 2013, vol. 7
2013
Cited alongside, same era.
A. Nedić and A. Olshevsky, “Distributed optimization over time-varying directed graphs,” IEEE Transactions on Automatic Control , vol. 60, no. 3, pp. 601–615, 2014
2014
Cited alongside, same era.
D. Jakovetić, J. Xavier, and J. M. Moura, “Fast distributed gradient methods,” IEEE Transactions on Automatic Control , vol. 59, no. 5, pp. 1131–1146, 2014
2014
Cited alongside, same era.
L. C. Evans and R. F. Gariepy, Measure Theory and Fine Properties of Functions . CRC press, 2015
2015
Cited alongside, same era.
D. Drusvyatskiy, A. D. Ioffe, and A. S. Lewis, “Curves of descent,” SIAM Journal on Control and Optimization , vol. 53, no. 1, pp. 114–138, 2015
2015
Cited alongside, same era.
P. Di Lorenzo and G. Scutari, “Next: In-network nonconvex optimization,” IEEE Transactions on Signal and Information Processing over Networks , vol. 2, no. 2, pp. 120–136, 2016
2016
Cited alongside, same era.
H.-T. Wai, J. Lafond, A. Scaglione, and E. Moulines, “Decentralized frank–wolfe algorithm for convex and nonconvex problems,” IEEE Transactions on Automatic Control , vol. 62, no. 11, pp. 5522–5537, 2017
2017
Later among the works it cites.
B. Swenson, R. Murray, and S. Kar, “On best-response dynamics in potential games,” SIAM Journal on Control and Optimization , vol. 56, no. 4, pp. 2734–2767, 2018
2018
Later among the works it cites.
Y. Tian, Y. Sun, and G. Scutari, “ASY-SONATA: Achieving linear convergence in distributed asynchronous multiagent optimization,” in Proceedings of Allerton Conference on Communication, Control, and Computing , 2018, pp. 543–551
2018
Later among the works it cites.
2018
Later among the works it cites.
——, “Second-order guarantees of gradient algorithms over networks,” in Proceedings of Allerton Conference on Communication, Control, and Computing , 2018, pp. 359–365
2018
Later among the works it cites.
J. D. Lee, I. Panageas, G. Piliouras, M. Simchowitz, M. I. Jordan, and B. Recht, “First-order methods almost always avoid strict saddle points,” Mathematical programming , vol. 176, no. 1-2, pp. 311–337, 2019
2019
Later among the works it cites.
R. Murray, B. Swenson, and S. Kar, “Revisiting normalized gradient descent: Fast evasion of saddle points,” IEEE Transactions on Automatic Control , vol. 64, no. 11, pp. 4818–4824, 2019
2019
Later among the works it cites.
G. Scutari and Y. Sun, “Distributed nonconvex constrained optimization over time-varying digraphs,” Mathematical Programming , vol. 176, no. 1-2, pp. 497–544, 2019
2019
Later among the works it cites.
H. Sun and M. Hong, “Distributed non-convex first-order optimization and information processing: Lower complexity bounds and rate optimal algorithms,” IEEE Transactions on Signal processing , vol. 67, no. 22, pp. 5912–5928, 2019
2019
Later among the works it cites.
B. Swenson, S. Kar, H. V. Poor, and J. M. Moura, “Annealing for distributed global optimization,” in Proceedings of IEEE Conference on Decision and Control . IEEE, 2019, pp. 3018–3025
2019
Later among the works it cites.
B. Swenson, R. Murray, H. V. Poor, and S. Kar, “Distributed gradient descent: Nonconvergence to saddle points and the stable-manifold theorem,” in Proceedings of Allerton Conference on Communication, Control, and Computing , 2019, pp. 595–601
2019
Later among the works it cites.
J. B. Conway, A course in functional analysis . Springer, 2019, vol. 96
2019
Later among the works it cites.
D. Davis, D. Drusvyatskiy, S. Kakade, and J. D. Lee, “Stochastic subgradient method converges on tame functions,” Foundations of Computational Mathematics , vol. 20, no. 1, pp. 119–154, 2020
2020
Closest in time.
A. Daniilidis and D. Drusvyatskiy, “Pathological subgradient dynamics,” SIAM Journal on Optimization , vol. 30, no. 2, pp. 1327–1338, 2020
2020
Closest in time.
B. Swenson, A. Sridhar, and H. V. Poor, “On distributed stochastic gradient algorithms for global optimization,” in Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing , 2020, pp. 8594–8598
2020
Closest in time.