L1 Adaptive Optimizer for Online Time-Varying Convex Optimization
Abstract
We propose an adaptive method for online time-varying (TV) convex optimization, termed L1 adaptive optimization (L1-AO). TV optimizers utilize a prediction model to exploit the temporal structure of TV problems, which can be inaccurate in the online implementation. Inspired by L1 adaptive control, the proposed method augments an adaptive update law to estimate and compensate for the uncertainty from the prediction inaccuracies. The proposed method provides performance bounds of the error in the optimization variables and cost function, allowing efficient and reliable optimization for TV problems. Numerical simulation results demonstrate the effectiveness of the proposed method for online TV convex optimization.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.