A Control Theoretical Approach to Online Constrained Optimization

Abstract

In this paper we focus on the solution of online problems with time-varying, linear equality and inequality constraints. Our approach is to design a novel online algorithm by leveraging the tools of control theory. In particular, for the case of equality constraints only, using robust control we design an online algorithm with asymptotic convergence to the optimal trajectory, differently from the alternatives that achieve non-zero tracking error. When also inequality constraints are present, we show how to modify the proposed algorithm to account for the wind-up induced by the nonnegativity constraints on the dual variables. We report numerical results that corroborate the theoretical analysis, and show how the proposed approach outperforms state-of-the-art algorithms both with equality and inequality constraints.

To appear in Automatica

References in corpus (7)

• A Class of Prediction-Correction Methods for Time-Varying Convex Optimization
• Online Primal-Dual Methods with Measurement Feedback for Time-Varying Convex Optimization
• Online Learning with Inexact Proximal Online Gradient Descent Algorithms
• Timescale Separation in Autonomous Optimization
• Optimization and Learning with Information Streams: Time-varying Algorithms and Applications
• Internal Model-Based Online Optimization
• Extrapolation-based Prediction-Correction Methods for Time-varying Convex Optimization