Computing the nearest $\Omega$-admissible descriptor dissipative Hamiltonian system
Vaishali Aggarwal, Nicolas Gillis, Punit Sharma

TL;DR
This paper characterizes and computes the nearest matrix pair that is $ ext{Omega}$-admissible, ensuring regularity, impulse-freeness, and eigenvalues within a specified LMI region, with applications demonstrated on data sets.
Contribution
It provides a dissipative Hamiltonian framework for $ ext{Omega}$-admissible pairs and introduces a method to find the nearest such pair to a given matrix pair.
Findings
The characterization applies to LMI regions.
The proposed method effectively finds the nearest $ ext{Omega}$-admissible pair.
Results outperform existing approaches on tested data sets.
Abstract
For a given set , a matrix pair is called -admissible if it is regular, impulse-free and its eigenvalues lie inside the region . In this paper, we provide a dissipative Hamiltonian characterization for the matrix pairs that are -admissible where is an LMI region. We then use these results for solving the nearest -admissible matrix pair problem: Given a matrix pair , find the nearest -admissible pair to the given pair . We illustrate our results on several data sets and compare with the state of the art.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Tensor decomposition and applications · Stability and Control of Uncertain Systems
