Online Coordinate Descent Algorithms for Time-Varying Convex Optimization Problems

This paper extends coordinate descent algorithms to the online setting where the objective function varies over time. It provides a thorough regret analysis for both random and deterministic online coordinate descent algorithms under convex and strongly convex settings.