Fetching the paper…
Reading the bibliography…
Consensus optimization has received considerable attention in recent years.
K. Knopp, Infinite sequences and series , Courier Corporation, 1956
1956
Earlier work this paper cites.
H. Robbins and D. Siegmund, A convergence theorem for nonnegative almost supermartingales and some applications , in Proc. Optim, Methods Stat., 233-257, 1971
1971
Earlier work this paper cites.
M. Nevelson and R.Z. Khasminskii, Stochastic approximation and recursive estimation , [translated from the Russian by Israel Program for Scientific Translations; translation edited by B. Silver]. Americal Mathematical Society, 1973
1973
Earlier work this paper cites.
A.M. Ostrowski, Solution of equations in Euclidean and Banach spaces , Academic Press, 1973
1973
Earlier work this paper cites.
J. Tsitsiklis, D. Bertsekas and M. Athans, Distributed asynchronous deterministic and stochastic gradient optimization algorithms , IEEE Trans. Automatic Control, AC-32(9): 803-812, 1986
1986
Earlier work this paper cites.
S. Łojasiewicz, Sur la géométrie semi-et sous-analytique , Ann. Inst. Fourier (Grenoble) 43(5): 1575-1595, 1993
1993
Earlier work this paper cites.
J. Fan, and R. Li, Variable selection via nonconcave penalized likelihood and its oracle properties , Journal of the American Statistical Association: Theory and Method, 96(456): 1348-1360, 2001
2001
Earlier work this paper cites.
D. Kempe, A. Dobra and J. Gehrke, Gossip-based computation of aggregate information , In Foundations of Computer Science, 2003. Proceedings 44th Annual IEEE Symposium on, 482-491, IEEE Computer Society, 2003
2003
Earlier work this paper cites.
M.F. Duarte, S. Sarvotham, D. Baron, M.B. Wakin, and R.G. Baraniuk, Distributed Compressed Sensing of Jointly Sparse Signals , Conference Record of the Thirty-Ninth Asilomar Conference on Signals, Systems and Computers, 1058-6393, 2005
2005
Earlier work this paper cites.
J. Bolte, A. Daniilidis and A. Lewis, The Łojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems , SIAM Journal on Optimization, 17(4): 1205-1223, 2007
2007
Earlier work this paper cites.
I. Schizas, A. Ribeiro and G. Giannakis, Consensus in ad hoc WSNs with noisy links-part I: Distributed estimation of deterministic signals , IEEE Trans. Signal Process., 56(1): 350-364, 2008
2008
Earlier work this paper cites.
H. Attouch, and J. Bolte, On the convergence of the proximal algorithm for nonsmooth functions involving analytic features , Math. Program., 116: 5-16, 2009
2009
Earlier work this paper cites.
A. Nedic and A. Ozdaglar, Distributed subgradient methods for multi-agent optimization , IEEE Trans. Automatic Control, 54(1): 48-61, 2009
2009
Earlier work this paper cites.
X. Chen, F. Xu, and Y. Ye, Lower bound theory of nonzero entries in solutions of ℓ 2 − ℓ p \ell_{2}-\ell_{p} minimization , SIAM Journal of Scientific Computing, 32(5): 2832-2852, 2010
2010
Earlier work this paper cites.
Q. Ling and Z. Tian, Decentralized sparse signal recovery for compressive sleeping wireless sensor networks, IEEE Trans. Signal Process. , 58(7): 3816-3827, 2010
2010
Earlier work this paper cites.
G. Mateos, J. Bazerque and G. Giannakis, Distributed sparse linear regression, IEEE Trans. Signal Process. , 58(10): 5262-5276, 2010
2010
Earlier work this paper cites.
S. Ram, A. Nedic and V. Veeravalli, Distributed stochastic subgradient projection algorithms for convex optimization , J. Optim. Theory Appl., 147: 516-545, 2010
2010
Earlier work this paper cites.
C.H. Zhang, Nearly unbiased variable selection under minimax concave penalty , Annals of Statistics, 38(2): 894-942, 2010
2010
Earlier work this paper cites.
I. Matei and J. Baras, Performance evaluation of the consensus-based distributed subgradient method under random communication topologies , IEEE J. Sel. Top. Signal Process., 5: 754-771, 2011
2011
Earlier work this paper cites.
M. Raginsky, N. Kiarashi and R. Willett, Decentralized online convex programming with local information , In: 2011 American Control Conference, San Francisco, CA, USA, 2011
2011
Earlier work this paper cites.
E. Bjornson, and E. Jorswieck, Optimal resource allocation in coordinated multi-cell systems , Foundations and Trends in Communications and Information Theory, 9(2-3): 113-381, 2012
2012
Earlier work this paper cites.
A. Chen and A. Ozdaglar, A fast distributed proximal gradient method , in Proc. 50th Allerton Conf. Commun., Control Comput., Moticello, IL, pp. 601-608, Oct. 2012
2012
Earlier work this paper cites.
A. Chen, Fast Distributed First-Order Methods , Master’s thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 2012
2012
Earlier work this paper cites.
H. Attouch, J. Bolte and B. Svaiter, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods , Math. Program., Ser. A, 137: 91-129, 2013
2013
Cited alongside, same era.
P. Bianchi and J. Jakubowicz, Convergence of a multi-agent projected stochastic gradient algorithm for nonconvex optimization , IEEE Trans. Automatic Control, 58(2): 391-405, 2013
2013
Cited alongside, same era.
P. Bianchi, G. Fort and W. Hachem, Performance of a distributed stochastic approximation algorithm , IEEE Trans. Information Theory, 59(11): 7405-7418, 2013
2013
Cited alongside, same era.
M. Hong and Z.-Q. Luo, Signal processing and optimal resource allocation for the interference channel, in Library in Signal Processing. New York: Academic Press, 2013, vol. 2, Communications and Radar Signal Processing, ch. 8, pp. 409-462
2013
Cited alongside, same era.
W. Shi, Q. Ling, G. Wu and W. Yin, A Proximal Gradient Algorithm for Decentralized Composite Optimization , IEEE Trans. Signal Processing, 63(22): 6013-6023, 2015
2015
Later among the works it cites.
H. Wai, T. Chang and A. Scaglione, A consensus-based decentralized algorithm for nonconvex optimization with application to dictionary learning , ICASSP 2015
2015
Later among the works it cites.
H. Wai, and A. Scaglione, Consensus on state and time: decentralized regression with asynchronous sampling , IEEE Transactions on Signal Processing, 63(11): 2972-2985, 2015
2015
Later among the works it cites.
E. Hazan, K.Y. Levy and S. Shalev-Shwarz, On graduated optimization for stochastic nonconvex problems , In Proceedings of the 33rd International Conference on Machine Learning, New York, NY, USA, 2016
2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Lee and A. Nedic, Distributed random projection algorithm for convex optimization, IEEE J. Sel. Topics Signal Process. , 7(2): 221-229, 2013
2013
Cited alongside, same era.
G. Tychogiorgos, A. Gkelias£¬and K. K. Leung A non-convex distributed optimization framework and its application to wireless ad-hoc networks, 12(9): 4286-4296, 2013
2013
Cited alongside, same era.
Y. Xu and W. Yin, A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion , SIAM Journal on Imaging Sciences, 6: 1758-1789, 2013
2013
Cited alongside, same era.
F. Yan, S. Sundaram, S. Vishwanathan and Y. Qi, Distributed autonomous online learning: regrets and intrinsic privacy-preserving properties , IEEE T Knowledge and Data Engineering, 25(11): 2483–2493, 2013
2013
Cited alongside, same era.
2013
Cited alongside, same era.
D. Jakovetic, J. Xavier and J. Moura, Fast distributed gradient methods , IEEE Trans. Automatic Control, 59: 1131-1146, 2014
2014
Cited alongside, same era.
H. McMahan and M. Streeter, Delay-Tolerant algorithms for asynchronous distributed online learning , In: Advances in Neural Information Processing Systems (NIPS), 2014
2014
Cited alongside, same era.
Stacy Patterson, Yonina C. Eldar, and Idit Keidar, Distributed compressed sensing for static and time-varying networks , IEEE Transactions on Signal Processing, 62(19): 4931-4946, 2014
2014
Cited alongside, same era.
2016
Closest in time.
J. Lafond, H. Wai and E. Moulines, D-FW: communication efficient distributed algorithms for high-dimensional sparse optimization , ICASSP 2016
2016
Closest in time.
S. Ghadimi, and G. Lan, Accelerated gradient methods for nonconvex nonlinear and stochastic programming , Mathematical Programming, 156(1-2): 59-99, 2016
2016
Closest in time.
P.D. Lorenzo and G. Scutari, NEXT: in-network nonconvex optimization , IEEE Trans. Signal and Information Processing over Network, 2(2): 120-136, 2016
2016
Closest in time.
P.D. Lorenzo and G. Scutari, Distributed nonconvex optimization over time-varying networks , ICASSP 2016
2016
Closest in time.
T. Tatarenko and B. Touri, On local analysis of distributed optimization , ACC 2016
2016
Closest in time.
K. Yuan, Q. Ling and W. Yin, On the Convergence of Decentralized Gradient Descent , SIAM Journal Optimization, 26(3): 1835-1854, 2016
2016
Closest in time.
J. Zeng, S. Lin and Z. Xu, Sparse regularization: convergence of iterative jumping thresholding algorithm , IEEE Transactions on Signal Processing, 64(19): 5160-5118, 2016
2016
Closest in time.
Y.T. Chow, T. Wu and W. Yin, Cyclic Coordinate Update Algorithms for Fixed-Point Problems: Analysis and Applications. SIAM J. Sci. Comput., 39(4): A1280-A1300, 2017
2017
Closest in time.
W. Deng, M. Lai, Z. Peng and W. Yin, Parallel multi-block admm with o(1/k) convergence , Journal of Scientific Computing, 71(2): 712-736, 2017
2017
Closest in time.
2017
Closest in time.
M. Hong, D. Hajinezhad, and M.-M. Zhao, Prox-PDA: the proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks , Proceedings of the 34th International Conference on Machine Learning, 70: 1529-1538, 2017
2017
Closest in time.
D. Hajinezhad, and M. Hong, Perturbed proximal primal dual algorithm for nonconvex nonsmooth optimization , (Technique Report) http://people.ece.umn.edu/~mhong/PProx_PDA.pdf , 2017
2017
Closest in time.
X. Lian, C. Zhang, H. Zhang, C.-J. Hsieh, W. Zhang, and J. Liu, Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent , In Proceedings of the 30th International Conference on Neural Information Processing Systems (NIPS), 2017
2017
Closest in time.
2017
Closest in time.
G. Qu and N. Li, Harnessing smoothness to accelerate distributed optimization , IEEE Transactions on Control of Network Systems, 2017, Volume: PP, Issue: 99
2017
Closest in time.
T. Tatarenko and B. Touri, Non-convex distributed optimization , IEEE Trans. Automat. Contr., 62(8): 3744-3757, 2017
2017
Closest in time.
H. Wai, A. Scaglione, J. Lafond and E. Moulines, Decentralized Frank-Wolfe algorithm for convex and nonconvex problems , IEEE Trans. Automatic Control, 62(11): 5522-5537, 2017
2017
Closest in time.