Online Feedback Optimization for Monotone Systems without Timescale Separation
Mattia Bianchi, Florian Dörfler
TL;DR
Online Feedback Optimization (OFO) steers a dynamical plant toward a cost-minimizing steady state using real-time measurements and input-output sensitivities. The paper removes the traditional timescale-separation requirement by exploiting monotone plant structure and a small-gain theorem, proving global convergence to the optimal operating point for any controller gain $\alpha$, under conditions depending only on steady-state maps $k_x$ and $k_y$. It provides verifiable sufficient conditions and regularization guidance to ensure the required convexity properties, including in stable LTI systems with quadratic costs. Numerical examples on LTI and gene-expression models illustrate robust convergence and trade-offs between convergence speed and transient overshoot, supporting the practicality of OFO without explicit time-scale separation.
Abstract
Online Feedback Optimization (OFO) steers a dynamical plant to a cost-efficient steady-state, only relying on input-output sensitivity information, rather than on a full plant model. Unlike traditional feedforward approaches, OFO leverages real-time measurements from the plant, thereby inheriting the robustness and adaptability of feedback control. Unfortunately, existing theoretical guarantees for OFO assume that the controller operates on a slower timescale than the plant, which can affect responsiveness and transient performance. In this paper, we focus on relaxing this ``timescale separation'' assumption. Specifically, we consider the class of monotone systems, and we prove that OFO can achieve an optimal operating point, regardless of the time constants of controller and plant. By leveraging a small gain theorem for monotone systems, we derive several sufficient conditions for global convergence. Notably, these conditions depend only on the steady-state behavior of the plant, and they are entirely independent of the transient dynamics.
