Fetching the paper…
Reading the bibliography…
We study distributed optimization problems when $N$ nodes minimize the sum of their individual costs subject to a common vector variable.
Y. E. Nesterov, “A method for solving the convex programming problem with convergence rate O ( 1 / k 2 ) (1/k^{2}) ,” Dokl. Akad. Nauk SSSR , vol. 269, pp. 543�–547, 1983, (in Russian)
1983
Earlier work this paper cites.
J. N. Tsitsiklis, “Problems in decentralized decision making and computation,” Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 1984
1984
Earlier work this paper cites.
J. Tsitsiklis, D. Bertsekas, and M. Athans, “Distributed asynchronous deterministic and stochastic gradient optimization algorithms,” IEEE Trans. Autom. Contr. , vol. 31, no. 9, pp. 803–812, Sep. 1986
1986
Earlier work this paper cites.
M. Rabbat and R. Nowak, “Distributed optimization in sensor networks,” in IPSN 2004, 3rd International Symposium on Information Processing in Sensor Networks , Berkeley, California, USA, April 2004, pp. 20 – 27
2004
Earlier work this paper cites.
D. Kempe and F. McSherry, “A decentralized algorithm for spectral analysis,” in 36th Annual ACM Symposium on Theory of Computing , Chicago, IL, August 2004, pp. 561�–568
2004
Earlier work this paper cites.
L. Xiao, S. Boyd, and S. Lall, “A scheme for robust distributed sensor fusion based on average consensus,” in IPSN ’05, Information Processing in Sensor Networks , Los Angeles, California, 2005, pp. 63–70
2005
Earlier work this paper cites.
C. Lopes and A. H. Sayed, “Adaptive estimation algorithms over distributed networks,” in 21st IEICE Signal Processing Symposium , Kyoto, Japan, Nov. 2006
2006
Earlier work this paper cites.
S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, “Randomized gossip algorithms,” IEEE Transactions on Information Theory , vol. 52, no. 6, pp. 2508–2530, June 2006
2006
Earlier work this paper cites.
2007
Earlier work this paper cites.
B. Johansson, A. Speranzon, M. Johansson, and K. H. Johansson, “On decentralized negotiation of optimal consensus,” Automatica , vol. 44, no. 4, pp. 1175–1179, 2008
2008
Earlier work this paper cites.
I. Necoara and J. A. K. Suykens, “Application of a smoothing technique to decomposition in convex optimization,” IEEE Trans. Autom. Contr. , vol. 53, no. 11, pp. 2674–2679, Dec. 2008
2008
Earlier work this paper cites.
I. Lobel and A. Ozdaglar, “Convergence analysis of distributed subgradient methods over random networks,” in 46th Annual Allerton Conference onCommunication, Control, and Computing , Monticello, Illinois, September 2008, pp. 353 – 360
2008
Earlier work this paper cites.
P. Tseng, “On accelerated proximal-gradient methods for convex-concave optimization,” submitted to SIAM J. Optim , 2008
2008
Earlier work this paper cites.
A. Nedic and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control , vol. 54, no. 1, pp. 48–61, January 2009
2009
Cited alongside, same era.
D. Blatt, A. Hero, and H. Gauchman, “A convergent incremental gradient method with a constant step size,” Siam J. Optim. , vol. 18, no. 1, pp. 29–51, 2009
2009
Cited alongside, same era.
G. Mateos, J. A. Bazerque, and G. B. Giannakis, “Distributed sparse linear regression,” IEEE Transactions on Signal Processing , vol. 58, no. 11, pp. 5262–5276, November 2010
2010
Cited alongside, same era.
L. Vandenberghe, “Optimization methods for large-scale systems,” 2010, lecture notes, available at: http://www.ee.ucla.edu/ vandenbe/ ee236c.html
2010
Cited alongside, same era.
H. Terelius, U. Topcu, and R. M. Murray, “Decentralized multi-agent optimization via dual decomposition,” in 18th World Congress of the International Federation of Automatic Control (IFAC) , Milano, Italy, August 2011, identifier: 10.3182/20110828-6-IT-1002.01959
2011
Closest in time.
E. Ghadimi, I. Shames, and M. Johansson, “Accelerated gradient methods for networked optimization,” in ACC ’11, American Control Conference , San Francisco, California, June 2011, pp. 1668–1673
2011
Closest in time.
J. Chen and A. H. Sayed, “Diffusion adaptation strategies for distributed optimization and learning over networks,” IEEE Trans. Sig. Process. , vol. 60, no. 8, pp. 4289–4305, Aug. 2012
2012
Closest in time.
J. Duchi, A. Agarwal, and M. Wainwright, “Dual averaging for distributed optimization: Convergence and network scaling,” IEEE Transactions on Automatic Control , vol. 57, no. 3, pp. 592–606, March 2012
2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends in Machine Learning, Michael Jordan, Editor in Chief , vol. 3, no. 1, pp. 1–122, 2011
2011
Cited alongside, same era.
S. Ram, A. Nedic, and V. Veeravalli, “Distributed stochastic subgradient projection algorithms for convex optimization,” Journal of Optimization Theory and Applications , vol. 147, no. 3, pp. 516–545, 2011
2011
Cited alongside, same era.
I. Matei and J. S. Baras, “Performance evaluation of the consensus-based distributed subgradient method under random communication topologies,” IEEE Journal of Selected Topics in Signal Processing , vol. 5, no. 4, pp. 754–771, 2011
2011
Cited alongside, same era.
K. Tsianos and M. Rabbat, “Distributed consensus and optimization under communication delays,” in 49th Allerton Conference on Communication, Control, and Computing , Monticello, Illinois, Sept. 2011, pp. 974–982
2011
Cited alongside, same era.
D. Jakovetic, J. Xavier, and J. M. F. Moura, “Cooperative convex optimization in networked systems: Augmented Lagrangian algorithms with directed gossip communication,” IEEE Transactions on Signal Processing , vol. 59, no. 8, pp. 3889–3902, August 2011
2011
Cited alongside, same era.
J. Mota, J. Xavier, P. Aguiar, and M. Pueschel, “Basis pursuit in sensor networks,” in ICASSP ’11, IEEE International Conference on Acoustics, Speech, and Signal Processing , Prague, Czech Republic, May 2011, pp. 2916–2919
2011
Cited alongside, same era.
U. V. Shanbhag, J. Koshal, and A. Nedic, “Multiuser optimization: distributed algorithms and error analysis,” SIAM Journal on Control and Optimization , vol. 21, no. 2, pp. 1046–1081, 2011
2011
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, Jan. 2012
2012
Closest in time.
A. Chen and A. Ozdaglar, “A fast distributed proximal gradient method,” in to appear in proc. 50th Allerton Conference on Communication, Control and Computing , Monticello, IL, October 2012
2012
Closest in time.
A. Chen, “Fast distributed first-order methods,” Master Thesis, Massachusetts Institute of Technology , 2012
2012
Closest in time.
——, “Distributed basis pursuit,” IEEE Trans. Sig. Process. , vol. 60, no. 4, pp. 1942–1956, April 2012
2012
Closest in time.
2012
Closest in time.
D. Jakovetic, J. M. F. Moura, and J. Xavier, “Distributed Nesterov-like gradient algorithms,” in CDC’12, 51 st {}^{\textrm{st}} IEEE Conference on Decision and Control , December 2012, pp. 5459–5464
2012
Closest in time.
2012
Closest in time.
M. Zargham, A. Ribeiro, and A. Jadbabaie, “A distributed line search for network optimization,” in American Control Conference , Montréal, Canada, June 2012, pp. 472–477
2012
Closest in time.