Fetching the paper…
Reading the bibliography…
This paper presents a distributed optimization scheme over a network of agents in the presence of cost uncertainties and over switching communication topologies.
J. Anthonisse and H. Tijms, “Exponential convergence of products of stochastic matrices,” Journal of Mathematical Analysis and Applications , vol. 59, no. 2, pp. 360–364, 1977
1977
Earlier work this paper cites.
N. Littlestone and M. Warmuth, “The weighted majority algorithm,” Information and Computation , vol. 108, pp. 212–261, 1994
1994
Earlier work this paper cites.
Y. Freund and R. E. Schapire, “A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting,” Journal of Computer and System Sciences , vol. 55, no. 1, pp. 119–139, 1997
1997
Earlier work this paper cites.
B. Bollobás, Modern Graph Theory . New York: Springer, 1998
1998
Earlier work this paper cites.
C. Godsil and G. Royle, Algebraic Graph Theory . Springer, 2001
2001
Earlier work this paper cites.
M. Zinkevich, “Online convex programming and generalized infinitesimal gradient ascent,” International Conference on Machine Learning , pp. 421–422, 2003
2003
Earlier work this paper cites.
A. Jadbabaie and A. Morse, “Coordination of groups of mobile autonomous agents using nearest neighbor rules,” IEEE Transactions on Automatic Control , vol. 48, no. 6, pp. 988–1001, 2003
2003
Earlier work this paper cites.
C. W. Wu, “On bounds of extremal eigenvalues of irreducible and m-reducible matrices,” Linear Algebra and its Applications , vol. 402, pp. 29–45, 2005
2005
Earlier work this paper cites.
Y. Kim and M. Mesbahi, “On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian,” IEEE Transactions on Automatic Control , vol. 51, no. 1, pp. 116–120, 2006
2006
Earlier work this paper cites.
A. Ghosh and S. Boyd, “Growing well-connected graphs,” IEEE Conference on Decision and Control , pp. 6605–6611, 2006
2006
Earlier work this paper cites.
S. Aldosari and J. Moura, “Topology of sensor networks in distributed detection,” IEEE International Conference on Acoustics, Speech and Signal Processing , pp. 1061–1064, 2006
2006
Earlier work this paper cites.
L. Xiao, S. Boyd, and S. Lall, “A space-time diffusion scheme for peer-to-peer least-squares estimation,” International Conference on Information Processing in Sensor Networks , pp. 168 – 176, 2006
2006
Earlier work this paper cites.
D. Mosk-Aoyama, T. Roughgarden, and D. Shah, “Fully distributed algorithms for convex optimization problems,” Distributed Computing , vol. 4731, pp. 492–493, 2007
2007
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. Wan, S. Roy, and A. Saberi, “Network design problems for controlling virus spread,” IEEE Conference on Decision and Control , pp. 3925–3932, 2007
2007
Cited alongside, same era.
Y. Nesterov, “Primal-dual subgradient methods for convex problems,” Mathematical Programming , vol. 120, pp. 221–259, 2007
2007
Cited alongside, same era.
K. Chi and X. Jiang, “Topology design of network-coding-based multicast networks,” IEEE Transaction on Parallel and Distributed Systems , vol. 19, no. 5, pp. 627–640, 2008
2008
Cited alongside, same era.
S. Kar and J. Moura, “Sensor networks with random links: Topology design for distributed consensus,” IEEE Transactions on Signal Processing , vol. 56, no. 7, pp. 3315–3326, 2008
2008
Cited alongside, same era.
A. Nedic and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control, , vol. 54, pp. 48–61, 2009
I. Lobel, A. Ozdaglar, and D. Feijer, “Distributed multi-agent optimization with state-dependent communication,” Mathematical programming , vol. 129, pp. 255–284, 2011
2011
Later among the works it cites.
M. Raginsky, N. Kiarashi, and R. Willett, “Decentralized Online Convex Programming with Local Information,” American Control Conference , pp. 5363–5369, 2011
2011
Later among the works it cites.
D. Zelazo and M. Mesbahi, “Edge agreement: graph-theoretic performance bounds and passivity analysis,” IEEE Transactions on Automatic Control , vol. 56, no. 3, pp. 544–555, 2011
2011
Later among the works it cites.
S. Bubeck, “Introduction to Online Optimization,” Lecture Notes , 2011
2011
Later among the works it cites.
E. Hazan, “The Convex Optimization Approach to Regret Minimization,” Optimization for machine learning , pp. 287–294, 2011
2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
S. Ram, A. Nedic, and V. Veeravalli, “Incremental stochastic subgradient algorithms for convex optimization,” SIAM Journal on Optimization , pp. 1–30, 2009
2009
Cited alongside, same era.
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
Cited alongside, same era.
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
Cited alongside, same era.
L. Xiao, “Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization,” Journal of Machine Learning Research , vol. 11, pp. 2543–2596, 2010
2010
Cited alongside, same era.
M. Mesbahi and M. Egerstedt, Graph Theoretic Methods in Multiagent Networks . NJ: Princeton University Press, 2010
2010
Cited alongside, same era.
M. E. Mehran Mesbahi, Graph Theoretic Methods in Multiagent Networks . Princeton University Press, 2010
2010
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, Aug. 2011
2011
Cited alongside, same era.
Later among the works it cites.
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
Later among the works it cites.
A. Agarwal and J. Duchi, “Distributed delayed stochastic optimization,” IEEE Conference on Decision and Control , pp. 5451–5452, 2012
2012
Later among the works it cites.
S. Shalev-Shwartz, “Online learning and online convex optimization,” Foundations and Trends in Machine Learning , vol. 4, pp. 107–194, 2012
2012
Later among the works it cites.
S. Lee and A. Nedic, “Distributed random projection algorithm for convex optimization,” IEEE Journal of Selected Topics in Signal Processing , vol. 7, pp. 221–229, 2013
2013
Later among the works it cites.
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. 2483 – 2493, 2013
2013
Later among the works it cites.
S. Hosseini, A. Chapman, and M. Mesbahi, “Online Distributed Optimization via Dual Averaging,” IEEE Conference on Decision and Control , pp. 1484 – 1489, 2013
2013
Later among the works it cites.
A. Chapman and M. Mesbahi, “Semi-autonomous consensus: network measures and adaptive trees,” IEEE Transactions on Automatic Control , vol. 58, no. 1, pp. 19–31, 2013
2013
Later among the works it cites.
A. Chapman, E. Schoof, and M. Mesbahi, “Distributed Online Topology Design for Disturbance Rejection,” IEEE Conference on Decision and Control , pp. 817 – 822, 2013
2013
Later among the works it cites.
A. Laszka, L. Buttyán, and D. Szeszlér, “Designing robust network topologies for wireless sensor networks in adversarial environments,” Pervasive and Mobile Computing , vol. 9, no. 4, pp. 546–563, 2013
2013
Later among the works it cites.