Fetching the paper…
Reading the bibliography…
This paper examines online distributed Alternating Direction Method of Multipliers (ADMM).
P. Lions and B. Mercier, “Splitting algorithms for the sum of two nonlinear operators,” SIAM Journal on Numerical Analysis , vol. 16, no. 6, pp. 964–979, 1979
1979
Earlier work this paper cites.
1979
Earlier work this paper cites.
D. Bertsekas, Nonlinear programming . Athena Scientific, 1999
1999
Earlier work this paper cites.
M. Zinkevich, “Online convex programming and generalized infinitesimal gradient ascent,” in International Conference on Machine Learning , 2003, pp. 421–422
2003
Earlier work this paper cites.
F. Facchinei and J.-S. Pang, Finite-dimensional variational inequalities and complementarity problems . Springer New York, 2003, vol. 1
2003
Earlier work this paper cites.
E. Hazan, A. Agarwal, and S. Kale, “Logarithmic regret algorithms for online convex optimization,” Machine Learning , vol. 69, pp. 169–192, 2007
2007
Earlier work this paper cites.
Y. Nesterov, “Primal-dual subgradient methods for convex problems,” Mathematical Programming , vol. 120, no. 1, pp. 221–259, 2007
2007
Earlier work this paper cites.
A. G. G. B. Schizas, Ioannis D. Ribeiro, “Consensus in ad hoc WSNs with noisy links - Part I: Distributed estimation of deterministic signals,” IEEE Transactions on Signal Processing , vol. 56, pp. 350–364, 2008
2008
Earlier work this paper cites.
A. Nedic and A. Ozdaglar, “Subgradient methods for saddle-point problems,” Journal of Optimization Theory and Applications , vol. 142, no. 1, pp. 205–228, 2009
2009
Earlier work this paper cites.
A. Nedic and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control , vol. 54, pp. 48–61, 2009
2009
Earlier work this paper cites.
S. Boyd, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends in Machine Learning , vol. 3, no. 1, pp. 1–122, 2010
2010
Earlier work this paper cites.
S. Sundhar 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.
I. Necoara, V. Nedelcu, and I. Dumitrache, “Parallel and distributed optimization methods for estimation and control in networks,” Journal of Process Control , vol. 21, no. 5, pp. 756 – 766, 2011
2011
Cited alongside, same era.
S. Bubeck, “Introduction to online optimization,” Lecture Notes , 2011
2011
Cited alongside, same era.
I. Lobel and A. Ozdaglar, “Distributed subgradient methods for convex optimization over random networks,” IEEE Transactions on Automatic Control , pp. 1291–1306, 2011
2011
Cited alongside, same era.
D. Bertsekas, “Incremental proximal methods for large scale convex optimization,” Mathematical Programming , vol. 129, no. 2, pp. 163–195, 2011
2011
Cited alongside, same era.
A. Dominguez Garcia, S. Cady, and C. Hadjicostis, “Decentralized optimal dispatch of distributed energy resources,” in IEEE Conference on Decision and Control , 2012, pp. 3688–3693
B. He and X. Yuan, “On the O ( 1 / n ) O(1/n) Convergence Rate of the Douglas-Rachford Alternating Direction Method,” SIAM Journal on Numerical Analysis , vol. 50, no. 2, pp. 700–709, 2012
2012
Later among the works it cites.
T. Suzuki, “Dual averaging and proximal gradient descent for online alternating direction multiplier method,” in International Conference on Machine Learning , vol. 28, 2013, pp. 392–400
2013
Later among the works it cites.
F. Iutzeler and P. Bianchi, “Asynchronous distributed optimization using a randomized alternating direction method of multipliers,” in IEEE Conference on Decision and Control , 2013, pp. 3671–3676
2013
Later among the works it cites.
E. Wei and A. Ozdaglar, “On the O ( 1 / k ) O(1/k) convergence of asynchronous distributed alternating direction method of multipliers,” in IEEE Global Conference on Signal and Information Processing , 2013, pp. 551–554
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…
2012
Cited alongside, same era.
2012
Cited alongside, same era.
H. Wang and A. Banerjee, “Online alternating direction method,” in International Conference on Machine Learning , no. 1, 2012, pp. 1119–1126
2012
Cited alongside, same era.
E. Wei and A. Ozdaglar, “Distributed alternating direction method of multipliers,” in IEEE Conference on Decision and Control , 2012, pp. 5445–5450
2012
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.
S. Shalev-Shwartz, “Online learning and online convex optimization,” Foundations and Trends in Machine Learning , vol. 4, pp. 107–194, 2012
2012
Cited alongside, same era.
E. Hazan, The Convex Optimization Approach to Regret Minimization . MIT Press, 2012, ch. 10, pp. 287–294
2012
Cited alongside, same era.
F. Yan, S. Sundaram, S. V. N. Vishwanathan, and Y. Qi, “Distributed autonomous online learning: Regrets and intrinsic privacy-preserving properties,” IEEE Transactions on Knowledge and Data Engineering , vol. 25, pp. 1041–4347, 2013
2013
Later among the works it cites.
S. Hosseini, A. Chapman, and M. Mesbahi, “Online distributed optimization via dual averaging,” in IEEE Conference on Decision and Control , 2013, pp. 1484–1489
2013
Later among the works it cites.
J. Mota, J. Xavier, P. Aguiar, and M. Puschel, “D-ADMM: A communication-efficient distributed algorithm for separable optimization,” IEEE Transactions on Signal Processing , vol. 61, no. 10, pp. 2718–2723, 2013
2013
Later among the works it cites.
2013
Later among the works it cites.
S. Hosseini, A. Chapman, and M. Mesbahi, “Online distributed ADMM via dual averaging,” in IEEE Conference on Decision and Control , 2014, pp. 904–909
2014
Closest in time.
A. Koppel, F. Jakubiec, and A. Ribeiro, “A saddle point algorithm for networked online convex optimization,” in IEEE International Conference on Acoustics, Speech and Signal Processing , 2014, pp. 8292–8296
2014
Closest in time.
T. Suzuki, “Stochastic dual coordinate ascent with alternating direction multiplier method,” in International Conference on Machine Learning , 2014, pp. 736–744
2014
Closest in time.