In this paper, we address tracking of a time-varying parameter with unknown dynamics. We
formalize the problem as an instance of online optimization in a dynamic setting. Using …

This paper studies the online optimal control problem with time-varying convex stage costs
for a time-invariant linear dynamical system, where a finite lookahead window of accurate …

We consider the problem of online control of systems with time-varying linear dynamics. To
state meaningful guarantees over changing environments, we introduce the metric of {\it …

This article considers online optimization with a finite prediction window of cost functions
and additional switching costs on the decisions. We study the fundamental limits of dynamic …

We investigate online convex optimization in non-stationary environments and choose
dynamic regret as the performance measure, defined as the difference between cumulative …

In this paper, online convex optimization problem with time-varying constraints is studied
from the perspective of an agent taking sequential actions. Both the objective function and …

This work focuses on dynamic regret of online convex optimization that compares the
performance of online learning to a clairvoyant who knows the sequence of loss functions in …

We investigate online convex optimization in non-stationary environments and choose the
dynamic regret as the performance measure, defined as the difference between cumulative …

In this paper, we study online convex optimization in dynamic environments, and aim to
bound the dynamic regret with respect to any sequence of comparators. Existing work have …

We study optimal regret bounds for control in linear dynamical systems under adversarially
changing strongly convex cost functions, given the knowledge of transition dynamics. This …