Fetching the paper…
Reading the bibliography…
We consider a decentralized online convex optimization problem in a network of agents, where each agent controls only a coordinate (or a part) of the global decision vector.
J. Tsitsiklis, “Problems in decentralized decision making and computation,” Ph.D. dissertation, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1984
1984
Earlier work this paper cites.
J. N. Tsitsiklis and M. Athans, “Convergence and asymptotic agreement in distributed decision problems,” IEEE Transactions on Automatic Control , vol. 29, pp. 42–50, 1984
1984
Earlier work this paper cites.
J. Tsitsiklis, D. Bertsekas, and M. Athans, “Distributed asynchronous deterministic and stochastic gradient optimization algorithms,” IEEE Transactions on Automatic Control , vol. 31, pp. 803–812, 1986
1986
Earlier work this paper cites.
S. Li and T. Basar, “Distributed learning algorithms for the computation of noncooperative equilibria,” Automatica , vol. 23, pp. 523–533, 1987
1987
Earlier work this paper cites.
L. Kleeman and R. Kuc, “Mobile robot sonar for target localization and classification,” International Journal of Robotics Research , vol. 14, no. 4, pp. 295–318, Aug 1995
1995
Earlier work this paper cites.
D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods . Belmont, MA: Athena Scientific, 1997
1997
Earlier work this paper cites.
D. Kempe, A. Dobra, and J. Gehrke, “Gossip-based computation of aggregate information,” in 44th Annual IEEE Symposium on Foundations of Computer Science , vol. 44, 2003, pp. 482––491
2003
Earlier work this paper cites.
P. Stoica and J. Li, “Source localization from range-difference measurements,” IEEE Signal Processing Mag. , pp. 63–66, November 2006
2006
Earlier work this paper cites.
A. Nedić and A. Ozdaglar, “On the rate of convergence of distributed subgradient methods for multi-agent optimization,” in Proceedings of IEEE CDC , 2007, pp. 4711–4716
2007
Earlier work this paper cites.
B. Johansson, M. Rabi, and M. Johansson, “A simple peer-to-peer algorithm for distributed optimization in sensor networks,” in 46th IEEE Conference on Decision and Control , 2007, pp. 4705 –4710
2007
Earlier work this paper cites.
D. A. Levin, Y. Peres, and E. L. Wilmer, Markov Chains and Mixing Times . Amer. Math. Soc., 2008
2008
Earlier work this paper cites.
S. S. Ponda, “Trajectory Optimization for Target Localization Using Small Unmanned Aerial Vehicles,” Master’s thesis, Massachusetts Institute of Technology, 2008
2008
Earlier work this paper cites.
F. Bullo, J. Cortés, and S. Martínez, Distributed Control of Robotic Networks . Applied Mathematics Series. Princeton University Press, 2009
2009
Earlier work this paper cites.
A. Nedić and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control , vol. 54, pp. 48–61, 2009
2009
Earlier work this paper cites.
Y. Nesterov, “Primal-dual subgradient methods for convex problems,” Math. Program., Ser. B , vol. 120, pp. 221–259, 2009
2009
Cited alongside, same era.
M. Mesbahi and M. Egerstedt, Graph Theoretic Methods for Multiagent Networks . Princeton, NJ, USA: Princeton University Press, 2010
2010
Cited alongside, same era.
S. Kar and J. Moura, “Distributed consensus algorithms in sensor networks: Quantized data and random link failures,” IEEE Trans. Signal Process. , vol. 58, pp. 1383 –1400, 2010
2010
Cited alongside, same era.
S. S. Ram, A. Nedić, and V. V. Veeravalli, “Distributed stochastic subgradient projection algorithms for convex optimization,” Journal of Optimization Theory and Applications , vol. 147, pp. 516–545, 2010
2010
Cited alongside, same era.
F. Benezit, V. Blondel, P. Thiran, J. Tsitsiklis, and M. Vetterli, “Weighted gossip: Distributed averaging using non-doubly stochastic matrices,” in IEEE International Symposium on Information Theory Proceedings (ISIT) , 2010, pp. 1753 –– 1757
A. Martinoli, F. Mondada, G. Mermoud, N. Correll, M. Egerstedt, A. Hsieh, L. Parker, and K. Stoy, Distributed Autonomous Robotic Systems . Springer Tracts in Advanced Robotics, Springer-Verlag, 2013
2013
Later among the works it cites.
——, “On the O ( 1 / k ) O(1/k) convergence of asynchronous distributed alternating direction method of multipliers,” in IEEE Global Conference on Signal and Information Processing , 2013, pp. 551–554
2013
Later among the works it cites.
T.-H. Chang, A. Nedić, and A. Scaglione, “Distributed constrained optimization by consensus-based primal-dual perturbation method,” IEEE Transactions on Automatic Control , vol. 59, pp. 1524–1538, 2014
2014
Later among the works it cites.
D. Jakovetic, J. Xavier, and J. M. F. Moura, “Fast distributed gradient methods,” IEEE Transactions on Automatic Control , vol. 59, no. 5, pp. 1131–1146, May 2014
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
L. Xiao, “Dual averaging methods for regularized stochastic learning and online optimization,” J. Machine Learning Res. , vol. 11, pp. 2543–2596, 2010
2010
Cited alongside, same era.
K. Srivastava and A. Nedić, “Distributed asynchronous constrained stochastic optimization,” IEEE Journal of Selected Topics in Signal Processing , vol. 5, pp. 772–790, 2011
2011
Cited alongside, same era.
D. Jakovetic, J. Xavier, and J. Moura, “Cooperative convex optimization in networked systems: Augmented lagrangian algorithms with directed gossip communication,” IEEE Transactions on Signal Processing , vol. 59, pp. 3889–3902, 2011
2011
Cited alongside, same era.
M. Raginsky, N. Kiarashi, and R. Willett, “Decentralized online convex programming with local information,” in Proceedings of the American Control Conference , 2011, pp. 5363–5369
2011
Cited alongside, same era.
K. Tsianos, S. Lawlor, and M. Rabbat, “Consensus-based distributed optimization: Practical issues and applications in large-scale machine learning,” in 50th Allerton Conference on Communication, Control, and Computing , 2012, pp. 1543–1550
2012
Cited alongside, same era.
——, “Push-sum distributed dual averaging for convex optimization,” in 51st Annual Conference on Decision and Control , 2012, pp. 5453 – 5458
2012
Cited alongside, same era.
E. Wei and A. Ozdaglar, “Distributed alternating direction method of multipliers,” in 51st IEEE Conference on Decision and Control and European Control Conference , 2012, pp. 5445–5450
2012
Cited alongside, same era.
Q. Ling and A. Ribeiro, “Decentralized dynamic optimization through the alternating direction method of multiplier,” IEEE Transactions on Signal Processing , vol. 62, pp. 1185–1197, 2014
2014
Later among the works it cites.
B. Gharesifard and J. Cortés, “Distributed continuous-time convex optimization on weight-balanced digraphs,” IEEE Transactions on Automatic Control , vol. 59, pp. 781–786, 2014
2014
Later among the works it cites.
D. Mateos-Nuñez and J. Cortés, “Distributed online convex optimization over jointly connected digraphs,” IEEE Transactions on Network Science and Engineering , vol. 1, pp. 23–37, 2014
2014
Later among the works it cites.
M. Akbari, B. Gharesifard, and T. Linder, “Distributed subgradient-push online convex optimization on time-varying directed graphs,” in 52nd Allerton Conference on Communication, Control, and Computing , 2014, pp. 264–269
2014
Later among the works it cites.
2014
Later among the works it cites.
2015
Closest in time.
A. Nedić and A. Olshevsky, “Distributed optimization over time-varying directed graphs,” IEEE Transactions on Automatic Control , vol. 60, pp. 601–615, 2015
2015
Closest in time.
2016
Closest in time.