Linear Matrix Inequality Approaches to Koopman Operator Approximation
arXiv:2102.03613
Abstract
The regression problem associated with finding a matrix approximation of the Koopman operator from data is considered. The regression problem is formulated as a convex optimization problem subject to linear matrix inequality (LMI) constraints. Doing so allows for additional LMI constraints to be incorporated into the regression problem. In particular, asymptotic stability constraints, regularization using matrix norms, and even regularization using system norms can be easily incorporated into the regression problem.
arXiv comment13 pages
References in corpus (4)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Linear predictors for nonlinear dynamical systems: Koopman operator meets model predictive control
- LMI Properties and Applications in Systems, Stability, and Control Theory
- A Convex Optimization Approach to Learning Koopman Operators