Fetching the paper…
Reading the bibliography…
Decentralized optimization algorithms have received much attention due to the recent advances in network information processing.
M. Frank and P. Wolfe, “An algorithm for quadratic programming,” Naval Res. Logis. Quart. , 1956
1956
Earlier work this paper cites.
E. A. Nirminskii, “Convergence conditions for nonlinear programming algorithms,” Cybernetics , no. 6, pp. 79–81, Nov 1972
1972
Earlier work this paper cites.
Z. Wu and K. Teo, “A conditional gradient method for an optimal control problem involving a class of nonlinear second-order hyperbolic partial differential equations,” Journal of Mathematical Analysis and Applications , vol. 91, no. 2, pp. 376 – 393, 1983
1983
Earlier work this paper cites.
J. Tsitsiklis, “Problems in decentralized decision making and computation,” Ph.D. dissertation, Dept. of Electrical Engineering and Computer Science, M.I.T., Boston, MA, 1984
1984
Earlier work this paper cites.
M. Fukushima, “A modified frank-wolfe algorithm for solving the traffic assignment problem,” Transportation Research Part B: Methodological , vol. 18, no. 2, pp. 169–177, April 1984
1984
Earlier work this paper cites.
B. P. Polyak, Introduction to Optimization . Optimization Software, Inc., 1987
1987
Earlier work this paper cites.
R. A. Horn and C. R. Johnson, Topics in matrix analysis . Cambridge: Cambridge University Press, 1994, corrected reprint of the 1991 original
1991
Earlier work this paper cites.
P. Massart, Concentration Inequalities and Model Selection . Springer, 2003
2003
Earlier work this paper cites.
H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations, and Advanced Topics . Wiley, 2004
2004
Earlier work this paper cites.
L. Xiao and S. Boyd, “Fast linear iterations for distributed averaging,” Systems & Control Letters , vol. 53, no. 1, pp. 65–78, Sep. 2004
2004
Earlier work this paper cites.
G. H. Mohimani, M. Babaie-Zadeh, and C. Jutten, “Fast Sparse Representation Based on Smoothed L0 Norm,” in ICA , ser. Lecture Notes in Computer Science. Springer, Sep. 2007, pp. 389–396
2007
Earlier work this paper cites.
E. v. Berg, M. P. Friedlander, G. Hennenfent, F. Herrmann, R. Saab, and Ö. Yılmaz, “Sparco: A testing framework for sparse reconstruction,” Dept. Computer Science, University of British Columbia, Vancouver, Tech. Rep. TR-2007-20, October 2007
2007
Earlier work this paper cites.
B. Johansson, T. Keviczky, M. Johansson, and K. H. Johansson, “Subgradient methods and consensus algorithms for solving convex optimization problems,” in Proc. CDC , Dec 2008, pp. 4185–4190
2008
Earlier work this paper cites.
J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra, “Efficient projections onto the ℓ 1 \ell_{1} -ball for learning in high dimensions,” in ICML , July 2008
2008
Earlier work this paper cites.
A. Scaglione, R. Pagliari, and H. Krim, “The decentralized estimation of the sample covariance,” in Proc. Asilomar , Nov. 2008, pp. 1722–1726
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
M. E. Yildiz and A. Scaglione, “Coding with side information for rate-constrained consensus,” IEEE Trans. on Signal Process. , vol. 56, no. 8, pp. 3753–3764, Aug 2008
2008
Earlier work this paper cites.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Found. Comput. Math. , vol. 9, no. 6, pp. 717–772, 2009
2009
Earlier work this paper cites.
V. Chandrasekaran, S. Sanghavi, P. A. Parrilo, and A. S. Willsky, “Sparse and low-rank matrix decompositions,” in Proc. Allerton , 2009, pp. 962–967
2009
Earlier work this paper cites.
Z. Liu and L. Vandenberghe, “Interior-point method for nuclear norm approximation with application to system identification,” SIAM J. Matrix Anal. Appl. , vol. 31, no. 3, pp. 1235–1256, 2010
2010
Earlier work this paper cites.
A. G. Dimakis, S. Kar, J. M. F. Moura, M. G. Rabbat, and A. Scaglione, “Gossip Algorithms for Distributed Signal Processing,” Proc. IEEE , vol. 98, no. 11, pp. 1847–1864, Nov. 2010
2010
Earlier work this paper cites.
S. Ram, A. Nedić, and 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
Cited alongside, same era.
M. Jaggi and M. Sulovsky, “A simple algorithm for nuclear norm regularized problems,” in ICML , June 2010
2010
Cited alongside, same era.
L. Bako, “Identification of switched linear systems via sparse optimization,” Automatica , vol. 47, no. 4, pp. 668 – 677, 2011
2011
Cited alongside, same era.
I.-A. Chen, “Fast distributed first-order methods,” Master’s thesis, MIT, 2012
2012
Cited alongside, same era.
J. Duchi, A. Agarwal, and M. J. Wainwright, “Dual averaging for distributed optimization: Convergence analysis and network scaling,” IEEE Trans. Autom. Control , vol. 57, no. 3, pp. 592–606, March 2012
2012
A. Defazio, F. Bach, and S. Lacoste-Julien, “SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives,” in NIPS , Dec 2014
2014
Later among the works it cites.
W. Shi, Q. Ling, G. Wu, and W. Yin, “A proximal gradient algorithm for decentralized composite optimization,” IEEE Trans. on Signal Process. , vol. 63, no. 22, pp. 6013–6023, Nov 2015
2015
Later among the works it cites.
H.-T. Wai and A. Scaglione, “Consensus on state and time: Decentralized regression with asynchronous sampling,” IEEE Trans. on Signal Process. , vol. 63, no. 11, pp. 2972–2985, June 2015
2015
Later among the works it cites.
H.-T. Wai, T.-H. Chang, and A. Scaglione, “A consensus-based decentralized algorithm for non-convex optimization with application to dictionary learning,” in Proc ICASSP , Apr 2015, pp. 3546–3550
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Q. Ling, Y. Xu, W. Yin, and Z. Wen, “Decentralized low-rank matrix completion,” in Proc ICASSP , Mar 2012
2012
Cited alongside, same era.
H.-F. Yu, C.-J. Hsieh, S. Si, and I. Dhillon, “Scalable coordinate descent approaches to parallel matrix factorization for recommender systems,” in ICDM . IEEE, 2012, pp. 765–774
2012
Cited alongside, same era.
A. H. Sayed, S.-Y. Tu, J. Chen, X. Zhao, and Z. J. Towfic, “Diffusion strategies for adaptation and learning over networks: an examination of distributed strategies and network behavior,” IEEE Signal Process. Mag. , vol. 30, no. 3, pp. 155–171, May 2013
2013
Cited alongside, same era.
P. Bianchi and J. Jakubowicz, “Convergence of a multi-agent projected stochastic gradient algorithm for non-convex optimization,” IEEE Trans. Autom. Control , vol. 58, no. 2, pp. 391–405, Feb 2013
2013
Cited alongside, same era.
X. Li and A. Scaglione, “Convergence and applications of a gossip based gauss newton algorithm,” IEEE Trans. on Signal Process. , vol. 61, no. 21, pp. 5231–5246, Nov 2013
2013
Cited alongside, same era.
2013
Cited alongside, same era.
M. Jaggi, “Revisiting Frank-Wolfe: Projection-free sparse convex optimization,” in ICML , June 2013
2013
Cited alongside, same era.
2015
Later among the works it cites.
S. Ghadimi and G. Lan, “Accelerated gradient methods for nonconvex nonlinear and stochastic programming,” Mathematical Programming , vol. 156, no. 1, pp. 59–99, Feb 2015
2015
Later among the works it cites.
L. Mackey, A. Talwalkar, and M. I. Jordan, “Distributed matrix completion and robust factorization,” Journal of Machine Learning Research , vol. 16, pp. 913–960, 2015
2015
Later among the works it cites.
F. M. Harper and J. A. Konstan, “The movielens datasets: History and context,” ACM TiiS , Jan 2015
2015
Later among the works it cites.
J. Lafond, H.-T. Wai, and E. Moulines, “D-FW: Communication Efficient Distributed Algorithms for High-dimensional Sparse Optimization,” in Proc ICASSP , Mar 2016
2016
Closest in time.
H.-T. Wai, A. Scaglione, J. Lafond, and E. Moulines, “A projection-free decentralized algorithm for non-convex optimization,” in Proc GlobalSIP , December 2016
2016
Closest in time.
C. Ravazzi, S. M. Fosson, and E. Magli, “Randomized algorithms for distributed nonlinear optimization under sparsity constraints,” IEEE Trans. on Signal Process. , vol. 64, no. 6, pp. 1420–1434, Mar 2016
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.
D. Varagnolo, F. Zanella, A. Cenedese, G. Pillonetto, and L. Schenato, “Newton-raphson consensus for distributed convex optimization,” IEEE Trans. Autom. Control , vol. 61, no. 4, pp. 994–1009, April 2016
2016
Closest in time.
A. Simonetto and H. Jamali-Rad, “Primal recovery from consensus-based dual decomposition for distributed convex optimization,” JOTA , vol. 168, no. 1, pp. 172–197, 2016
2016
Closest in time.
2016
Closest in time.
P. D. Lorenzo and G. Scutari, “Next: In-network nonconvex optimization,” IEEE Trans. on Signal and Info. Process. over Networks , 2016
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.