Convex Reformulation of Minkowski-Sum Outer Approximation for Matrix Ellipsoids in Data-Driven Control
Abstract
Approximating Minkowski sums of matrix ellipsoids by a single matrix ellipsoid provides a tractable description of noise bounds for controller design from noisy data. Existing linear matrix inequality (LMI) conditions can be used to compute such approximations, but directly solving the resulting optimization problems can be computationally expensive. This paper develops an efficient method for finding a minimum-volume outer matrix ellipsoid under these LMI conditions. Although the corresponding problem for ordinary vector-valued ellipsoids is convex, the objective function in the matrix-valued case is nonconvex. We find that the problem admits an equivalent convex reformulation, which resolves this difficulty. We first eliminate the matrix variables using equivalent LMI transformations and objective monotonicity, leaving one positive scalar variable per matrix ellipsoid in the sum. We then show that the objective becomes convex after a logarithmic change of variables. The resulting problem contains neither LMI constraints nor matrix variables and can therefore be solved efficiently. Numerical experiments confirm that the proposed method is substantially faster than the LMI-based method. An application to data-driven control further illustrates the tradeoff between guaranteed control performance and computation time.
Related
- Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms
- A Brunn--Minkowski inequality and Convexity for the 2-Hessian eigenvalue in convex domains
- A Brunn-Minkowski Theory for the Distribution of Random Pairs of Points in Convex Bodies
- Gauss--Chebyshev Quadrature, 𝕊1-Designs, and the Planar Minkowski Inverse Problem: A One-Dimensional Model for Design-Induced Convex Geometry
- Optimal Control Under Signal Temporal Logic Constraints: A Robust Reformulation via Augmented Dynamics
BibTeX
@misc{kaminaga2026convex,
title = {{Convex Reformulation of Minkowski-Sum Outer Approximation for Matrix Ellipsoids in Data-Driven Control}},
author = {Taira Kaminaga and Hampei Sasahara},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.02553},
eprint = {2611.02553},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.02553},
}
RIS
TY - UNPB
TI - Convex Reformulation of Minkowski-Sum Outer Approximation for Matrix Ellipsoids in Data-Driven Control
AU - Taira Kaminaga
AU - Hampei Sasahara
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.02553
UR - https://arxiv.org/abs/2611.02553
AB - Approximating Minkowski sums of matrix ellipsoids by a single matrix ellipsoid provides a tractable description of noise bounds for controller design from noisy data. Existing linear matrix inequality (LMI) conditions can be used to compute such approximations, but directly solving the resulting optimization problems can be computationally expensive. This paper develops an efficient method for finding a minimum-volume outer matrix ellipsoid under these LMI conditions. Although the corresponding problem for ordinary vector-valued ellipsoids is convex, the objective function in the matrix-valued case is nonconvex. We find that the problem admits an equivalent convex reformulation, which resolves this difficulty. We first eliminate the matrix variables using equivalent LMI transformations and objective monotonicity, leaving one positive scalar variable per matrix ellipsoid in the sum. We then show that the objective becomes convex after a logarithmic change of variables. The resulting problem contains neither LMI constraints nor matrix variables and can therefore be solved efficiently. Numerical experiments confirm that the proposed method is substantially faster than the LMI-based method. An application to data-driven control further illustrates the tradeoff between guaranteed control performance and computation time.
ER -