Distributed Stochastic Nonsmooth Nonconvex Optimization

F. H. Clarke, Optimization and nonsmooth analysis . Siam, 1990, vol. 5

1990

Earlier work this paper cites.

R. T. Rockafellar, S. Uryasev et al. , “Optimization of conditional value-at-risk,” Journal of risk , vol. 2, pp. 21–42, 2000

2000

Earlier work this paper cites.

H. Kushner and G. G. Yin, Stochastic approximation and recursive algorithms and applications . Springer Science & Business Media, 2003, vol. 35

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.

R. T. Rockafellar and R. J.-B. Wets, Variational analysis . Springer Science & Business Media, 2009, vol. 317

2009

Earlier work this paper cites.

V. S. Borkar, Stochastic approximation: a dynamical systems viewpoint . Springer, 2009, vol. 48

2009

Earlier work this paper cites.

A. Nedic, A. Ozdaglar, and P. A. Parrilo, “Constrained consensus and optimization in multi-agent networks,” IEEE Trans. on Automatic Control , vol. 55, pp. 922–938, April 2010

2010

Earlier work this paper cites.

S. S. Ram, A. Nedić, and V. V. Veeravalli, “Distributed stochastic subgradient projection algorithms for convex optimization,” Journal of optimization theory and applications , vol. 147, no. 3, pp. 516–545, 2010

2010

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, 2013

2013

Cited alongside, same era.

P. Bianchi, G. Fort, and W. Hachem, “Performance of a distributed stochastic approximation algorithm,” IEEE Transactions on Information Theory , vol. 59, no. 11, pp. 7405–7418, Nov 2013

2013

Cited alongside, same era.

F. T. Leighton, Introduction to parallel algorithms and architectures: Arrays· trees· hypercubes . Elsevier, 2014

2014

Cited alongside, same era.

A. Nedic and A. Olshevsky, “Distributed optimization over time-varying directed graphs,” IEEE Transactions on Automatic Control , vol. 60, no. 3, pp. 601–615, 2015

2015

Cited alongside, same era.

I. Goodfellow, Y. Bengio, A. Courville, and Y. Bengio, Deep learning . MIT press Cambridge, 2016, vol. 1

M. Hong, D. Hajinezhad, and M. M. Zhao, “Prox-PDA: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks,” in Proceedings of the 34th International Conference on Machine Learning (ICML) , vol. 70, Sydney, Australia, August 2017, pp. 1529–1538

2017

Later among the works it cites.

T. Tatarenko and B. Touri, “Non-convex distributed optimization,” IEEE Trans. on Automatic Control , vol. 62, pp. 3744–3757, August 2017

2017

Later among the works it cites.

A. Nedich, A. Olshevsky, and M. G. Rabbat, “Network topology and communication-computation tradeoffs in decentralized optimization,” Proceedings of the IEEE , pp. 953–976, May 2018

2018

Later among the works it cites.

G. Scutari and Y. Sun, “Parallel and distributed successive convex approximation methods for big-data optimization,” in Multi-agent Optimization , F. Facchinei and J.-S. Pang, Eds. Lecture Notes in Mathematics 2224, Springer, 2018, ch. 3, pp. 141–308

2018

Later among the works it cites.