Fetching the paper…
Reading the bibliography…
We develop multi-step gradient methods for network-constrained optimization of strongly convex functions with Lipschitz-continuous gradients.
G. H. Golub and R. S. Varga, “Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order richardson iterative methods,” Numerische Matematik , vol. 3, pp. 147–156, 1961
1961
Earlier work this paper cites.
D. M. Young, “Second-degree iterative methods for the solution of large linear systems,” Journal of Approximation Theory , 1972
1972
Earlier work this paper cites.
Y. C. Ho, L. Servi, and R. Suri, “A class of center-free resource allocation algorithms,” Large Scale Systems , vol. 1, pp. 51–62, 1980
1980
Earlier work this paper cites.
R. A. Horn and C. R. Johnson, Matrix Analysis . Cambridge, 1985
1985
Earlier work this paper cites.
J. Tsitsiklis, D. Bertsekas, and M. Athans, “Distributed asynchronous deterministic and stochastic gradient optimization algorithms,” Automatic Control, IEEE Transactions on , vol. 31 Issue: 9, pp. 803–812, 1986
1986
Earlier work this paper cites.
B. Polyak, Introduction to Optimization . ISBN 0-911575-14-6, 1987
1987
Earlier work this paper cites.
J. B. H. Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms II . Springer, 1996
1996
Earlier work this paper cites.
D. Bertsekas and J. Tsitsiklis, Parallel and distributed computation:Numerical methods . New York: Athena Scientific, 1997
1997
Earlier work this paper cites.
F. R. K. Chung, Spectral Graph Theory . CBMS Regional Conference Series in Mathematics, No. 92, American Mathematical Society, 1997
1997
Earlier work this paper cites.
F. Kelly, A. Maulloo, and D. Tan, “Rate control in communication networks: shadow prices, proportional fairness and stability,” Journal of the Operational Research Society , vol. 49, pp. 237–252, 1998
1998
Earlier work this paper cites.
D. Bertsekas., Nonlinear Programming . Athena Scientific, 1999
1999
Earlier work this paper cites.
S. Low and D. Lapsley, “Optimization flow control - i: Basic algorithm and convergence.” IEEE/ACM Transactions on Networking , vol. 7 Issue: 6, pp. 861–874, 1999
1999
Cited alongside, same era.
D. Goodman and N. Mandayam, “Power control for wireless data,” Personal Communications, IEEE , vol. 7 Issue:2, pp. 48–54, 2000
2000
Cited alongside, same era.
A. Jadbabaie, J. Lin, and A. Morse, “Coordination of groups of mobile autonomous agents using nearest neighbor rules,” Automatic Control, IEEE Transactions on , vol. 48, pp. 988 – 1001, 2003
2003
Cited alongside, same era.
Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course . Springer, 2004
2004
Cited alongside, same era.
L. Xiao and S. Boyd, “Fast linear iterations for distributed averaging,” Systems and Control Letters , vol. 53 Issue: 1, pp. 65–78, 2004
2004
B. Johansson, “On distributed optimization in networked systems,” Ph.D. dissertation, Royal Institute of Technology, 2008
2008
Later among the works it cites.
J. Liu, B. D. O. Anderson, M. Cao, and A. S. Morse, “Analysis of accelerated gossip algorithms,” in 48th IEEE Conference on Decision and Control (CDC) , 2009
2009
Later among the works it cites.
B. Oreshkin, M. Coates, and M. Rabbat, “Optimization and analysis of distributed averaging with short node memory,” Signal Processing, IEEE Transactions on , vol. 58 Issue: 5, pp. 2850 –2865, 2010
2010
Later among the works it cites.
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 , vol. 3 Issue: 1, pp. 1–122, 2011
2011
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.
L. Xiao, M. Johansson, and S. Boyd, “Simultaneous routing and resource allocation via dual decomposition,” IEEE Transactions on Communications , vol. 52 Issue: 7, pp. 1136–1144, 2004
2004
Cited alongside, same era.
——, “Smooth minimization of non-smooth functions,” Mathematical Programming , 2005
2005
Cited alongside, same era.
M. Cao, D. A. Spielman, and E. M. Yeh, “Accelerated gossip algorithms for distributed computation,” in 44th Annual Allerton Conference on Communication, Control, and Computation , 2006, pp. 952–959
2006
Cited alongside, same era.
L. Xiao and S. Boyd, “Optimal scaling of a gradient method for distributed resource allocation,” J. Opt. Theory and Applications , vol. 129 Issue:3, pp. 469–488, 2006
2006
Cited alongside, same era.
R. Olfati-Saber, J. A. Fax, and R. M. Murray, “Consensus and cooperation in networked multi-agent systems,” Proceedings of the IEEE , vol. 95 Issue: 1, pp. 215–233, 2007
2007
Cited alongside, same era.
M. Chiang, S. Low, A. Calderbank, and J. Doyle, “Layering as optimization decomposition: A mathematical theory of network architectures,” Proceedings of the IEEE , vol. 95 Issue:1, pp. 255 – 312, 2007
2007
Cited alongside, same era.
F. Zanella, D. Varagnolo, A. Cenedese, G. Pillonetto, and L. Schenato, “Newton-raphson consensus for distributed convex optimization,” in IEEE Conference on Decision and Control (CDC) , 2011
2011
Later among the works it cites.
E. Wei, A. Ozdaglar, and A. Jadbabaie, “A distributed newton method for network utility maximization, i: Algorithm,” LIDS report 2832 , 2011
2011
Later among the works it cites.
T. Erseghe, D. Zennaro, E. Dall’Anese, and L. Vangelista, “Fast consensus by the alternating direction multipliers method,” Signal Processing, IEEE Transactions on , vol. 59, no. 11, pp. 5523 –5537, nov. 2011
2011
Later among the works it cites.
O. Devolder, F. Glineur, and Y. Nesterov, “A double smoothing technique for constrained convex optimization problems and applications to optimal control,” submitted to SIAM Journal on Optimization , 2011
2011
Later among the works it cites.
S. Kar, J. M. F. Moura, and K. Ramanan, “Distributed Parameter Estimation in Sensor Networks: Nonlinear Observation Models and Imperfect Communication,” IEEE Trans. on Information Theory , 2012
2012
Closest in time.
L. Vandenberghe, “Course notes for optimization methods for large-scale systems, ee236c, dual decomposition chapter,” 2012
2012
Closest in time.