Data-driven distributionally robust MPC for systems with multiplicative noise: A semi-infinite semi-definite programming approach
Abstract
This article introduces a novel distributionally robust model predictive control (DRMPC) algorithm for a specific class of controlled dynamical systems where the disturbance multiplies the state and control variables. These classes of systems arise in mathematical finance, where the paradigm of distributionally robust optimization (DRO) fits perfectly, and this serves as the primary motivation for this work. We recast the optimal control problem (OCP) as a semi-definite program with an infinite number of constraints, making the ensuing optimization problem a \emph{semi-infinite semi-definite program} (SI-SDP). To numerically solve the SI-SDP, we advance an approach for solving convex semi-infinite programs (SIPs) to SI-SDPs and, subsequently, solve the DRMPC problem. A numerical example is provided to show the effectiveness of the algorithm.
Cite
@article{arxiv.2408.15193,
title = {Data-driven distributionally robust MPC for systems with multiplicative noise: A semi-infinite semi-definite programming approach},
author = {Souvik Das and Siddhartha Ganguly and Ashwin Aravind and Debasish Chatterjee},
journal= {arXiv preprint arXiv:2408.15193},
year = {2024}
}
Comments
To appear in the proceedings of Mathematical Theory of Networks and Systems (MTNS) 2024