Linear Matrix Inequality Approaches to Koopman Operator Approximation

02/06/2021
by   Steven Dahdah, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/18/2021

System Norm Regularization Methods for Koopman Operator Approximation

Approximating the Koopman operator from data is numerically challenging ...
research
11/11/2019

Variational Representations related to Quantum Rényi Relative Entropies

In this note, we focus on the variational representations of some matrix...
research
08/27/2018

A Limitation of V-Matrix based Methods

To estimate the conditional probability functions based on the direct pr...
research
03/16/2020

Symmetric Grothendieck inequality

We establish an analogue of the Grothendieck inequality where the rectan...
research
11/06/2019

Linear Support Vector Regression with Linear Constraints

This paper studies the addition of linear constraints to the Support Vec...
research
11/22/2014

Characterization of the equivalence of robustification and regularization in linear and matrix regression

The notion of developing statistical methods in machine learning which a...
research
05/27/2021

OpReg-Boost: Learning to Accelerate Online Algorithms with Operator Regression

This paper presents a new regularization approach – termed OpReg-Boost –...

Please sign up or login with your details

Forgot password? Click here to reset