Approximating the nearest stable discrete-time system

Abstract

In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$ is stable if and only if it can be written as $A=S^{-1}UBS$, where $S$ is positive definite, $U$ is orthogonal, and $B$ is a positive semidefinite contraction (that is, the singular values of $B$ are less or equal to 1). This characterization results in an equivalent non-convex optimization problem with a feasible set on which it is easy to project. We propose a very efficient fast projected gradient method to tackle the problem in variables $(S,U,B)$ and generate locally optimal solutions. We show the effectiveness of the proposed method compared to other approaches.

15 pages, new title, accepted in LAA

References in corpus (3)

• On computing the distance to stability for matrices using linear dissipative Hamiltonian systems
• Finding the nearest positive-real system
• Computing nearest stable matrix pairs

Cited by in corpus (10)

• Efficient Learning of a Linear Dynamical System with Stability Guarantees
• A note on approximating the nearest stable discrete-time descriptor system with fixed rank
• Memory-Efficient Learning of Stable Linear Dynamical Systems for Prediction and Control
• Stabilizing reinforcement learning control: A modular framework for optimizing over all stable behavior
• On approximating the nearest Ω-stable matrix
• Stable Reduced-Rank VAR Identification
• Characterizing matrices with eigenvalues in an LMI region: A dissipative-Hamiltonian approach
• Learning Data-Driven PCHD Models for Control Engineering Applications
• Stability Preserving Data-driven Models With Latent Dynamics
• Topological Linear System Identification via Moderate Deviations Theory