Time-Varying Convex Optimization: Time-Structured Algorithms and Applications
Open accessThe DOI matches its Crossref record; 77 of the 77 references it cites were found in a registry or an index.
Abstract
Optimization underpins many of the challenges that science and technology face on a daily basis. Recent years have witnessed a major shift from traditional optimization paradigms grounded on batch algorithms for medium-scale problems to challenging dynamic, time-varying, and even huge-size settings. This is driven by technological transformations that converted infrastructural and social platforms into complex and dynamic networked systems with even pervasive sensing and computing capabilities. This article reviews a broad class of state-of-the-art algorithms for time-varying optimization, with an eye to performing both algorithmic development and performance analysis. It offers a comprehensive overview of available tools and methods and unveils open challenges in application domains of broad range of interest. The real-world examples presented include smart power systems, robotics, machine learning, and data analytics, highlighting domain-specific issues and solutions. The ultimate goal is to exemplify wide engineering relevance of analytical tools and pertinent theoretical foundations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952 · cited 1×
“…a representative problem spanning the broad fields of machine learning and signal processing, we focus on the reconstruction of sparse signals via (cid:96) 1 -regularization where we are interested in recovering a sparse signal given some observations, e.g., extract “sparse” features in images [73].”
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Constrained model predictive control: Stability and optimality
Mayne, D. Q., Rawlings, J. B., Rao, C. V., & Scokaert, P. O. M. (2000) · Automatica · doi:10.1016/s0005-1098(99)00214-9 · Cited by 8,736
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021 · cited 2×
“[44] F.”
BackgroundAn Introduction to Variational Inequalities and Their Applications
Kinderlehrer, D., & Stampacchia, G. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719451 · Cited by 4,433 · cited 1×
“Variational inequalities [89] can be framed as optimization problems, while evolutionary ones can be framed as time-varying optimization problems.”
BackgroundIntroductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698 · cited 2×
“We deal with convex optimization problems [14], [15], as well as first-order algorithms [16].”
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
Srinivas, N., Krause, A., Kakade, S. M., & Seeger, M. W. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2182033 · Cited by 1,850 · cited 1×
“Dynamic means of capturing the underlying optimization trajectory are now largely based on models, while in the current data streaming era, problems are often constructed in a data-driven fashion (e.g., via zero-order/bandit methods [108] or in a Bayesian setting [109]).”
Background(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
Numerical Continuation Methods
Allgower, E. L., & Georg, K. (1990) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-61257-2 · Cited by 1,269
Online Learning and Online Convex Optimization
Shalev-Shwartz, S. (2012) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000018 · Cited by 1,246
On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
Alonso-Mora, J., Samaranayake, S., Wallar, A., Frazzoli, E., & Rus, D. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1611675114 · Cited by 1,186 · cited 2×
“Motivated by the recent widespread use of ridesharing and mobility-on-demand services [69], spatio-temporal-variations naturally emerge from customer pick-up and drop-off requests as well as fleet locations.”
BackgroundNumerical Continuation Methods--An Introduction.
Watson, L. T., Allgower, E. L., & Georg, K. (1992) · Mathematics of Computation · doi:10.2307/2153001 · Cited by 991 · cited 4×
“…predict how the optimization problem changes and then they correct for the errors in predictions based on the newly acquired cost [8], [27]) and have roots in non-stationary optimization [2], [36], parametric programming [4], [7], [19], [37], and continuation methods in numerical mathematics [38].”
BackgroundMethodInfluential(2002) · IEEE Control Systems · doi:10.1109/37.980245 · Cited by 796 · cited 1×
“Problems such as congestion control, resource allocation, and power control have been of paramount importance in communication networks [44], [45].”
BackgroundCyber–Physical Systems: A Perspective at the Centennial
Kim, K.-D., & Kumar, P. R. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2189792 · Cited by 761 · cited 2×
“[58] K.”
BackgroundDistributed Continuous-Time Convex Optimization With Time-Varying Cost Functions
Rahili, S., & Ren, W. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2593899 · Cited by 343
Non-stationary stochastic optimization
Besbes, O., Gur, Y., & Zeevi, A. (2015) · Operations Research · doi:10.1287/opre.2015.1408 · Cited by 337 · cited 1×
“In addition, for fixed (cid:37) P p 0 , 1 q , C ă 8 , and if the path-length ř “ 1 } x ‹ p t k q´ x ‹ p t k ´ 1 q} grows at least linearly in T , no unstructured method of this type can reach a zero ATE [21], [22].”
MethodDistributed Online Optimization in Dynamic Environments Using Mirror Descent
Shahrampour, S., & Jadbabaie, A. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2743462 · Cited by 331
Dall'Anese, E. (2016) · 2016 American Control Conference (ACC) · doi:10.1109/acc.2016.7525172 · Cited by 315 · cited 5×
“…(e.g., voltages and power flows on lines) induced by x ; that is, y p t k q “ A x x ` A w w p t k q , where w p t k q is a vector collecting the powers of non-controllable devices and A x , A w are sensitivity matrices that are built based on the network topology and the line impedances [61], [65].”
BackgroundMethodInfluentialSelf-citationEmbedded Online Optimization for Model Predictive Control at Megahertz Rates
Jerez, J. L., Goulart, P. J., Richter, S., Constantinides, G. A., Kerrigan, E. C., & Morari, M. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2351991 · Cited by 256
Time-dependent routing problems: A review
Gendreau, M., Ghiani, G., & Guerriero, E. (2015) · Computers & Operations Research · doi:10.1016/j.cor.2015.06.001 · Cited by 253
Splitting methods for monotone operators with applications to parallel optimization
Eckstein, J. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 250
Tang, Y., Dvijotham, K., & Low, S. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2704922 · Cited by 245 · cited 1×
“[63] Y.”
Lateral Vehicle Trajectory Optimization Using Constrained Linear Time-Varying MPC
Gutjahr, B., Groll, L., & Werling, M. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2016.2614705 · Cited by 227 · cited 1×
“Recently, time-varying (and/or parameter-varying) algorithms for MPC have appeared for large-scale and embedded systems, e.g., [13], [50]–[52], which are a mix of continuous-time, discrete-time unstructured and structured algorithms.”
BackgroundAdapting to a Changing Environment: the Brownian Restless Bandits.
Slivkins, A., & Upfal, E. (2008) · Conference on Learning Theory · Cited by 200
Real-time city-scale ridesharing via linear assignment problems
Simonetto, A., Monteil, J., & Gambella, C. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.01.019 · Cited by 196
Self-citationOnline Optimization : Competing with Dynamic ComparatorsPreprint
Jadbabaie, A., Rakhlin, A., Shahrampour, S., & Sridharan, K. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1501.06225 · Cited by 175 · cited 2×
“In [24], one has access to a sequence p m k q k P N ` of gradient approximators.”
Bernstein, A., Reyes-Chamorro, L., Boudec, J. L., & Paolone, M. (2015) · Electric Power Systems Research · doi:10.1016/j.epsr.2015.03.023 · Cited by 172 · cited 2×
“Finally, “feedback” can come in the form of measurements of the actual power outputs xi(tk) [60], as well as other electrical quantities [61], [66].”
BackgroundA Class of Prediction-Correction Methods for Time-Varying Convex Optimization
Simonetto, A., Mokhtari, A., Koppel, A., Leus, G., & Ribeiro, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2568161 · Cited by 166 · cited 5×
“The results of Theorem 2 are fairly general and apply to different problem classes [27], [28].”
BackgroundInfluentialSelf-citationDistributed Time-Varying Quadratic Optimization for Multiple Agents Under Undirected Graphs
Sun, C., Ye, M., & Hu, G. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2673240 · Cited by 160 · cited 2×
“In continuous-time this scheme has been used in distributed time-varying convex optimization e.g. [5], [39]–[41].”
BackgroundMethodSparse Recovery of Streaming Signals Using $\ell_1$ -Homotopy
Asif, M. S., & Romberg, J. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2328981 · Cited by 158
Decentralized Dynamic Optimization Through the Alternating Direction Method of Multipliers
Ling, Q. H., & Ribeiro, A. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2295055 · Cited by 150
Online Optimization as a Feedback Controller: Stability and Tracking
Colombino, M., Dall’Anese, E., & Bernstein, A. (2019) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2906916 · Cited by 149 · cited 2×
“Initial efforts toward unstructured online algorithms include [56], [57], where a Lyapunov analysis is also provided, and the more recent works in [116], [117] that provide a pertinent regret analysis).”
BackgroundSelf-citationTaylor, J. A., Dhople, S. V., & Callaway, D. S. (2016) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2015.12.083 · Cited by 145
Sensor-based reactive navigation in unknown convex sphere worlds
Arslan, Ö., & Koditschek, D. E. (2018) · The International Journal of Robotics Research · doi:10.1177/0278364918796267 · Cited by 139 · cited 1×
“In the context of safe navigation [96], [97] consider the problem of using power diagrams to define a local safe space, which depends on the position of the agent itself.”
BackgroundOnline Learning with Predictable SequencesPreprint
Rakhlin, A., & Sridharan, K. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1208.3728 · Cited by 130 · cited 1×
“Expert oracles, hints, or predictable sequences are considered, e.g., in [23]–[25].”
BackgroundContinuous and discrete Zhang dynamics for real-time varying nonlinear optimization
Jin, L., & Zhang, Y. (2015) · Numerical Algorithms · doi:10.1007/s11075-015-0088-1 · Cited by 128 · cited 2×
“Other prediction models exist for other classes of optimization problems [27], [28], for higher-order Taylor expansions [4], and for more complex numerical integration methods [29], [31]–[34].”
MethodMiao, P., Shen, Y., Huang, Y., & Wang, Y. (2014) · Neural Computing and Applications · doi:10.1007/s00521-014-1744-4 · Cited by 128 · cited 2×
“Another interesting application is that of robotic manipulators [32], [99], [100], obtained via zeroing neural dynamics (ZND) [101]–[103], based on a prediction step similar to (25).”
BackgroundRecommendations for real-time speech MRI
Lingala, S. G., Sutton, B. P., Miquel, M. E., & Nayak, K. S. (2015) · Journal of Magnetic Resonance Imaging · doi:10.1002/jmri.24997 · Cited by 124 · cited 2×
“In the series of work [85] and [86], the authors describe an unstructured algorithm to solve a time-varying subsampled nonlinear regularized inverse problem.”
BackgroundPredictive routing for autonomous mobility-on-demand systems with ride-sharing
Alonso–Mora, J., Wallar, A., & Rus, D. L. (2017) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2017.8206203 · Cited by 120 · cited 1×
“In [71], an online algorithm based on a structured problem formulation is presented, where the prediction is based on historical data and machine learning forecasting.”
MethodOnline Primal-Dual Methods With Measurement Feedback for Time-Varying Convex Optimization
Bernstein, A., Dall’Anese, E., & Simonetto, A. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2896112 · Cited by 111 · cited 2×
“For some applications such as the demand response and the OPF, online algorithms have been designed to leverage measurements of constraints (e.g., voltages violations) in the algorithmic updates [18], [61], [66] to relax the sensing requirements.”
BackgroundMethodSelf-citationReal-Time Nonlinear Optimization as a Generalized Equation
Zavala, V. M., & Anitescu, M. (2010) · SIAM Journal on Control and Optimization · doi:10.1137/090762634 · Cited by 105 · cited 4×
“‚ Prediction based on first-order optimality conditions [4], [7], [8], [27]–[29].”
BackgroundInfluentialLearning and Management for Internet of Things: Accounting for Adaptivity and Scalability
Chen, T., Barbarossa, S., Wang, X., Giannakis, G. B., & Zhang, Z.-L. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2896243 · Cited by 103
Self-citationOnline Learning With Inexact Proximal Online Gradient Descent Algorithms
Dixit, R., Bedi, A. S., Tripathi, R., & Rajawat, K. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2890368 · Cited by 103 · cited 2×
“…Figure 2 1 illustrates the asymptotic tracking error (asymptotic difference between optimal decisions and decisions delivered by some algorithms that will be described shortly) for different sampling periods ( h ) of discrete-time algorithms, for a robot tracking problem (see [10] for the setting).”
BackgroundNetwork Integrity in Mobile Robotic Networks
Zavlanos, M. M., Ribeiro, A., & Pappas, G. J. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2203215 · Cited by 99 · cited 2×
“Both structured and unstructured methods have been investigated [5], [17], [39]–[41], [48], [80]–[82], [98], [104], [113], but many challenges remain.”
BackgroundMethodOptimization and Learning With Information Streams: Time-varying algorithms and applications
Dall’Anese, E., Simonetto, A., Becker, S., & Madden, L. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2968813 · Cited by 86 · cited 2×
“As discussed in [114], most distributed methods rely on diminishing step-size rules, which might not be an appropriate choice in time-varying settings when the algorithm runs indefinitely (as in e.g., video surveillance and monitoring of critical infrastructure).”
BackgroundMethodSelf-citationCojocaru, M., Daniele, P., & Nagurney, A. (2005) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-005-7502-0 · Cited by 86 · cited 1×
“[91] M.”
D-MAP: Distributed Maximum a Posteriori Probability Estimation of Dynamic Systems
Jakubiec, F. Y., & Ribeiro, A. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222398 · Cited by 84 · cited 3×
“[82] F.”
BackgroundModel-Based and Data-Driven Strategies in Medical Image Computing
Rueckert, D., & Schnabel, J. A. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2943836 · Cited by 83 · cited 1×
“Here we focus on the new possibilities offered by new and fast imaging modalities under magnetic resonance (see [83], [84] for a broader context).”
BackgroundDecentralized Prediction-Correction Methods for Networked Time-Varying Convex Optimization
Simonetto, A., Koppel, A., Mokhtari, A., Leus, G. J. T., & Ribeiro, A. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2694611 · Cited by 83
Self-citationRecursive Recovery of Sparse Signal Sequences From Compressive Measurements: A Review
Vaswani, N., & Zhan, J. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2539138 · Cited by 83 · cited 1×
“Works that explore dynamic (cid:96) 1 reconstruction are, e.g., [74]–[76].”
BackgroundOnline optimization in closed loop on the power flow manifold
Hauswirth, A., Zanardi, A., Bolognani, S., Dorfler, F., & Hug, G. (2017) · 2017 IEEE Manchester PowerTech · doi:10.1109/ptc.2017.7980998 · Cited by 69 · cited 1×
“[62] A.”
A Parametric Nonconvex Decomposition Algorithm for Real-Time and Distributed NMPC
Hours, J.-H., & Jones, C. N. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2426231 · Cited by 67 · cited 3×
“[51] J.”
BackgroundMethodInfluentialTran-Dinh, Q., Savorgnan, C., & Diehl, M. (2012) · SIAM Journal on Optimization · doi:10.1137/110844349 · Cited by 64 · cited 1×
“Time-varying optimization has been studied for applications within mathematical programming, e.g., in the context of parametric-programming [3], [4], [7], [37], [87] where a wealth of structured and unstructured algorithms are presented.”
BackgroundExact robot navigation using power diagrams
Arslan, Ö., & Koditschek, D. E. (2016) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2016.7487090 · Cited by 60 · cited 6×
“…due to the presence of obstacles, however one can convexify it by looking at the collision-free convex local workspace around x r , defined as [96] LF p x r q“ x P W : p x i ´ x r q J x ´ b i p x r q ď 0 , i “ 1 . . . m where b i p x r q are pertinent scalars computed depending on robot and…”
BackgroundMethodInfluentialDecentralized Dynamic Optimization for Power Network Voltage Control
Liu, H. J., Shi, W., & Zhu, H. (2016) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2016.2631886 · Cited by 60 · cited 1×
“[64] H.”
Dynamic Filtering of Time-Varying Sparse Signals via $\ell _1$ Minimization
Charles, A. S., Balavoine, A., & Rozell, C. J. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2586745 · Cited by 59
QoE-Traffic Optimization Through Collaborative Edge Caching in Adaptive Mobile Video Streaming
Mehrabi, A., Siekkinen, M., & Ylä-Jääski, A. (2018) · IEEE Access · doi:10.1109/access.2018.2870855 · Cited by 56 · cited 1×
“controllable traffic flows are time-varying, with changes that are faster than the solution time of underlying optimization tasks, and even more so in the 5G era [46] (for e.”
BackgroundSecure Mobile Edge Computing in IoT via Collaborative Online Learning
Li, B., Chen, T., & Giannakis, G. B. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2949504 · Cited by 49 · cited 1×
“nks are active research thrusts that are pursued in diverse applications, such as allocation of network resources, secure mobile edge computing, and management of Internet-of-Things; see e.g., [120], [121], and references therein. Clearly, at the core of OCO, bandits, and RL are sequential solutions of optimization ob…”
BackgroundSelf-citationDiscrete and Continuous-Time Soft-Thresholding for Dynamic Signal Recovery
Balavoine, A., Rozell, C. J., & Romberg, J. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2420535 · Cited by 46
Li, Y., Qu, G., & Li, N. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431296 · Cited by 42 · cited 1×
“In addition, for fixed (cid:37) P p 0 , 1 q , C ă 8 , and if the path-length ř “ 1 } x ‹ p t k q´ x ‹ p t k ´ 1 q} grows at least linearly in T , no unstructured method of this type can reach a zero ATE [21], [22].”
MethodDynamic Distribution State Estimation Using Synchrophasor Data
Song, J., Dall’Anese, E., Simonetto, A., & Zhu, H. (2019) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2019.2943540 · Cited by 41 · cited 1×
“Real-time measurements were used in a state estimation framework in [67].”
MethodSelf-citationDistributed and Inexact Proximal Gradient Method for Online Convex Optimization
Bastianello, N., & Dall’Anese, E. (2021) · European Control Conference (ECC) · doi:10.23919/ecc54610.2021.9654953 · Cited by 40 · cited 2×
“Another insight from [113], [114], and [115] is that the convergence behavior of distributed algorithms in the online setting is different relative to the batch case: traditional hierarchies in terms of convergence may be “flipped,” with the slowest algorithm in the static case being the fastest algorithm in the time-…”
BackgroundSelf-citationCan Primal Methods Outperform Primal-Dual Methods in Decentralized Dynamic Optimization?
Yuan, K., Xu, W., & Ling, Q. H. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3011640 · Cited by 36
Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems
Tang, Y., Dall’Anese, E., Bernstein, A., & Low, S. H. (2022) · SIAM Journal on Control and Optimization · doi:10.1137/20m1371063 · Cited by 28 · cited 1×
“For example, unstructured methods have been proposed for various non-strongly convex problems, as well nonconvex cost functions, where notions of dynamic regret can be used as performance indicators, see e.g., [17], [18], and e.g., [65], [105]–[107].”
BackgroundSelf-citationZhang, Y., Qi, Z., Qiu, B., Yang, M., & Xiao, M. (2019) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2019.2919397 · Cited by 27 · cited 2×
“Another interesting application is that of robotic manipulators [32], [99], [100], obtained via zeroing neural dynamics (ZND) [101]–[103], based on a prediction step similar to (25).”
BackgroundADMM for Distributed Dynamic Beamforming
Maros, M., & Jaldén, J. (2017) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2017.2681205 · Cited by 27
Dekel, O., Flajolet, A., Haghtalab, N., & Jaillet, P. (2017) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 22
Distributed dynamic optimization over directed graphs
Xi, C., & Khan, U. A. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798277 · Cited by 21 · cited 1×
“[40] C.”
Online Optimization Using Zeroth Order Oracles
Shames, I., Selvaratnam, D., & Manton, J. H. (2019) · IEEE Control Systems Letters · doi:10.1109/lcsys.2019.2921593 · Cited by 20
Online Gradient Descent for Linear Dynamical Systems
Nonhoff, M., & Müller, M. A. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.1258 · Cited by 19 · cited 1×
“Initial efforts toward unstructured online algorithms include [56], [57], where a Lyapunov analysis is also provided, and the more recent works in [116], [117] that provide a pertinent regret analysis).”
BackgroundA Coordinate-Descent Algorithm for Tracking Solutions in Time-Varying Optimal Power Flows
Liu, J., Mareček, J., Simonetta, A., & Takač, M. (2018) · Power Systems Computation Conference · doi:10.23919/pscc.2018.8442544 · Cited by 16
Time-varying convex optimization for double-integrator dynamics over a directed network
Gong, P., Chen, F., & Lan, W. (2016) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2016.7554519 · Cited by 15 · cited 2×
“In continuous-time this scheme has been used in distributed time-varying convex optimization e.g. [5], [39]–[41].”
BackgroundMethodAbsence of spurious local trajectories in time-varying optimizationPreprint
Fattahi, S., Josz, C., Mohammadi-Ghazi, R., Lavaei, J., & Sojoudi, S. (2019) · arXiv (Cornell University) · Cited by 8
Model adaptation and unsupervised learning with non-stationary batch data under smooth concept driftPreprint
Das, S., Lade, P., & Srinivasan, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.04094 · Cited by 5 · cited 1×
“Additional lines of work include dynamic classification under concept drift [79], dynamic beamforming [80], and other dynamic signal processing tasks, such as maximum a posteriori estimation [81], [82].”
Background
Metadata
- Authors
- Simonetto, A., Dall'Anese, E., Paternain, S., Leus, G., & Giannakis, G. B.
- Venue
- Proceedings of the IEEE
- Published
- 2020-11
- Volume
- 108
- Issue
- 11
- Pages
- 2032-2048
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W3035326699
- Cited by
- 177
- References
- 77
- FWCI
- 9.41
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.