Fetching the paper…
Reading the bibliography…
We study deterministic and stochastic primal-dual sub-gradient algorithms for distributed optimization of a separable objective function with global inequality constraints.
T. E. Stern, “A class of decentralized routing algorithms using relaxation,” IEEE Transactions on Communications , vol. 25, no. 10, pp. 1092–1102, 1977
1977
Earlier work this paper cites.
D. P. Bertsekas and J. N. Tsitsiklis, Parallel and distributed computation: numerical methods . Prentice hall Englewood Cliffs, NJ, 1989, vol. 23
1989
Earlier work this paper cites.
J. Hiriart-Urruty and C. Lemaréchal, “Convex analysis and minimization algorithms, part i: Fundamentals, vol. 305 of grundlehren der mathematischen wissenschaften,” 1996
1996
Earlier work this paper cites.
D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small-world’networks,” nature , vol. 393, no. 6684, pp. 440–442, 1998
1998
Earlier work this paper cites.
B. Bollobás, Random graphs . Springer, 1998
1998
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.
A. G. Bakirtzis and P. N. Biskas, “A decentralized solution to the DC-OPF of interconnected power systems,” IEEE Transactions on Power Systems , vol. 18, no. 3, pp. 1007–1013, 2003
2003
Earlier work this paper cites.
D. M. Stipanović, G. Inalhan, R. Teo, and C. J. Tomlin, “Decentralized overlapping control of a formation of unmanned aerial vehicles,” Automatica , vol. 40, no. 8, pp. 1285–1296, 2004
2004
Earlier work this paper cites.
J. A. Fax and R. M. Murray, “Information flow and cooperative control of vehicle formations,” IEEE Transactions on Automatic Control , vol. 49, no. 9, pp. 1465–1476, 2004
2004
Earlier work this paper cites.
P. Ögren, E. Fiorelli, and N. E. Leonard, “Cooperative control of mobile sensor networks: Adaptive gradient climbing in a distributed environment,” IEEE Transactions on Automatic Control , vol. 49, no. 8, pp. 1292–1302, 2004
2004
Cited alongside, same era.
S. Boyd and L. Vandenberghe, Convex optimization . Cambridge university press, 2004
2004
Cited alongside, same era.
F. Chung and L. Lu, “Concentration inequalities and martingale inequalities: a survey,” Internet Mathematics , vol. 3, no. 1, pp. 79–127, 2006
2006
Cited alongside, same era.
A. Nedić and A. Ozdaglar, “sub-gradient methods for saddle-point problems,” Journal of optimization theory and applications , vol. 142, no. 1, pp. 205–228, 2009
2009
Cited alongside, same era.
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, 2012
2012
Later among the works it cites.
M. Mahdavi, R. Jin, and T. Yang, “Trading regret for efficiency: online convex optimization with long term constraints,” The Journal of Machine Learning Research , vol. 13, no. 1, pp. 2503–2528, 2012
2012
Later among the works it cites.
M. Mahdavi, T. Yang, R. Jin, S. Zhu, and J. Yi, “Stochastic gradient descent with only one projection,” in Advances in Neural Information Processing Systems , 2012, pp. 494–502
2012
Later among the works it cites.
S. Lee and A. Nedic, “Distributed random projection algorithm for convex optimization,” IEEE Journal of Selected Topics in Signal Processing , vol. 7, no. 2, pp. 221–229, 2013
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Agarwal, M. J. Wainwright, P. L. Bartlett, and P. K. Ravikumar, “Information-theoretic lower bounds on the oracle complexity of convex optimization,” in Advances in Neural Information Processing Systems , 2009, pp. 1–9
2009
Cited alongside, same era.
S. S. Ram, A. Nedić, and V. V. Veeravalli, “Distributed stochastic sub-gradient projection algorithms for convex optimization,” Journal of optimization theory and applications , vol. 147, no. 3, pp. 516–545, 2010
2010
Cited alongside, same era.
J. Koshal, A. Nedić, and U. V. Shanbhag, “Multiuser optimization: distributed algorithms and error analysis,” SIAM Journal on Optimization , vol. 21, no. 3, pp. 1046–1081, 2011
2011
Cited alongside, same era.
D. Yuan, S. Xu, and H. Zhao, “Distributed primal–dual sub-gradient method for multiagent optimization via consensus algorithms,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics , vol. 41, no. 6, pp. 1715–1724, 2011
2011
Cited alongside, same era.
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, 2012
2012
Cited alongside, same era.
M. Grant and S. Boyd, “CVX: MATLAB software for disciplined convex programming.”
Cited in the paper.
N. Li and J. R. Marden, “Decoupling coupled constraints through utility design,” IEEE Transactions on Automatic Control , vol. 59, no. 8, pp. 2289–2294, 2014
2014
Later among the works it cites.
T.-H. Chang, A. Nedić, and A. Scaglione, “Distributed constrained optimization by consensus-based primal-dual perturbation method,” IEEE Transactions on Automatic Control , vol. 59, no. 6, pp. 1524–1538, 2014
2014
Later among the works it cites.
2014
Later among the works it cites.
D. Yuan, D. W. Ho, and S. Xu, “Regularized primal-dual sub-gradient method for distributed constrained optimization,” IEEE transactions on cybernetics , vol. 46, no. 9, pp. 2109–2118, 2016
2016
Closest in time.