Fetching the paper…
Reading the bibliography…
We consider the problem of tracking the minimum of a time-varying convex optimization problem over a dynamic graph.
B. Widrow, J. M. McCool, M. G. Larimore, and C. R. Johnson, “Stationary and nonstationary learning characteristics of the lms adaptive filter,”
1976
Earlier work this paper cites.
E. T. Whittaker and G. N. Watson,
1996
Earlier work this paper cites.
R. M. Corless, G. H. Gonnet, D. E. Hare, D. J. Jeffrey, and D. E. Knuth, “On the Lambert W function,”
1996
Earlier work this paper cites.
M. Zinkevich, “Online convex programming and generalized infinitesimal gradient ascent,” in
2003
Earlier work this paper cites.
D. Verscheure, B. Demeulenaere, J. Swevers, J. De Schutter, and M. Diehl, “Time-optimal path tracking for robots: A convex optimization approach,”
2009
Earlier work this paper cites.
A. Nedic and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,”
2009
Earlier work this paper cites.
S. S. Ram, A. Nedić, and V. V. Veeravalli, “Incremental stochastic subgradient algorithms for convex optimization,”
2009
Earlier work this paper cites.
Y. Chen, Y. Gu, and A. O. Hero, “Sparse lms for system identification,” in
2009
Earlier work this paper cites.
J. Chen, X. Cao, P. Cheng, Y. Xiao, and Y. Sun, “Distributed collaborative control for industrial automation with wireless sensor and actuator networks,”
2010
Earlier work this paper cites.
F. Bénézit, V. Blondel, P. Thiran, J. Tsitsiklis, and M. Vetterli, “Weighted gossip: Distributed averaging using non-doubly stochastic matrices,” in
2010
Earlier work this paper cites.
D. Angelosante, J. A. Bazerque, and G. B. Giannakis, “Online adaptive estimation of sparse signals: Where rls meets the
2010
Earlier work this paper cites.
T. Ardeshiri, M. Norrlöf, J. Löfberg, and A. Hansson, “Convex optimization approach for time-optimal path tracking of robots with speed dependent constraints,” in
2011
Earlier work this paper cites.
S. Boyd, N. Parikh, E. Chu, B. Peleato, J. Eckstein
2011
Earlier work this paper cites.
M. Schmidt, N. L. Roux, and F. R. Bach, “Convergence rates of inexact proximal-gradient methods for convex optimization,” in
2011
Earlier work this paper cites.
M. Uecker, S. Zhang, D. Voit, K.-D. Merboldt, and J. Frahm, “Real-time mri: recent advances using radial flash,”
2012
Earlier work this paper cites.
A. I. Chen and A. Ozdaglar, “A fast distributed proximal-gradient method,” in
2012
Earlier work this paper cites.
H. Wang and A. Banerjee, “Online alternating direction method,” in
2012
Cited alongside, same era.
Z. Zhang and B. D. Rao, “Recovery of block sparse signals using the framework of block sparse bayesian learning,” in
2012
Cited alongside, same era.
E. Dall’Anese, H. Zhu, and G. B. Giannakis, “Distributed optimal power flow for smart microgrids.”
2013
Cited alongside, same era.
F. Y. Jakubiec and A. Ribeiro, “D-map: Distributed maximum a posteriori probability estimation of dynamic systems,”
2013
Cited alongside, same era.
T. Suzuki, “Dual averaging and proximal gradient descent for online alternating direction multiplier method,” in
2013
Cited alongside, same era.
E. Karseras, K. Leung, and W. Dai, “Tracking dynamic sparse signals using hierarchical bayesian kalman filters,” in
F. Dufossè, K. Kaya, I. Panagiotas, and B. Ucar, “Further notes on Birkhoff-von neumann decomposition of doubly stochastic matrices,”
2015
Later among the works it cites.
N. Vaswani and J. Zhan, “Recursive recovery of sparse signal sequences from compressive measurements: A review.”
2016
Later among the works it cites.
A. Mokhtari, S. Shahrampour, A. Jadbabaie, and A. Ribeiro, “Online optimization in dynamic environments: Improved regret rates for strongly convex problems,” in
2016
Later among the works it cites.
T. Yang, L. Zhang, R. Jin, and J. Yi, “Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient,” in
2016
Later among the works it cites.
T. Chen, Y. Shen, Q. Ling, and G. B. Giannakis, “Online learning for “thing-adaptive” fog computing in IoT,” in
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
J. L. Jerez, P. J. Goulart, S. Richter, G. A. Constantinides, E. C. Kerrigan, and M. Morari, “Embedded online optimization for model predictive control at megahertz rates,”
2014
Cited alongside, same era.
C. Zhao, U. Topcu, N. Li, and S. Low, “Design and stability of load-side primary frequency control in power systems,”
2014
Cited alongside, same era.
Q. Ling and A. Ribeiro, “Decentralized dynamic optimization through the alternating direction method of multipliers,”
2014
Cited alongside, same era.
A. Simonetto and G. Leus, “On non-differentiable time-varying optimization,” in
2015
Cited alongside, same era.
A. Nedich
2015
Cited alongside, same era.
A. Nedić and A. Olshevsky, “Distributed optimization over time-varying directed graphs,”
2015
Cited alongside, same era.
B. Gutjahr, L. Gröll, and M. Werling, “Lateral vehicle trajectory optimization using constrained linear time-varying mpc,”
2017
Later among the works it cites.
R. Tripathi, B. Mohan, and K. Rajawat, “Adaptive low-rank matrix completion,”
2017
Later among the works it cites.
A. Simonetto, A. Koppel, A. Mokhtari, G. Leus, and A. Ribeiro, “Decentralized prediction-correction methods for networked time-varying convex optimization,”
2017
Later among the works it cites.
L. Zhang, T. Yang, J. Yi, J. Rong, and Z.-H. Zhou, “Improved dynamic regret for non-degenerate functions,” in
2017
Later among the works it cites.
S. Khanna and C. R. Murthy, “Decentralized joint-sparse signal recovery: A sparse bayesian learning approach,”
2017
Later among the works it cites.
A. Nedić and J. Liu, “Distributed optimization for control,”
2018
Later among the works it cites.
A. S. Bedi, P. Sarma, and K. Rajawat, “Tracking moving agents via inexact online gradient descent algorithm,”
2018
Later among the works it cites.
S. Shahrampour and A. Jadbabaie, “Distributed online optimization in dynamic environments using mirror descent,”
2018
Later among the works it cites.
S. Radhika and S. Arumugam, “Robust variable zero attractor controller based za-lms algorithm for variable sparsity environment,”
2018
Later among the works it cites.
2018
Later among the works it cites.
R. Dixit, A. S. Bedi, R. Tripathi, and K. Rajawat, “Online learning with inexact proximal online gradient descent algorithms,”
2019
Closest in time.