On computing the distance to stability for matrices using linear dissipative Hamiltonian systems
arXiv:1611.00595 · doi:10.1016/j.automatica.2017.07.047
Abstract
In this paper, we consider the problem of computing the nearest stable matrix to an unstable one. We propose new algorithms to solve this problem based on a reformulation using linear dissipative Hamiltonian systems: we show that a matrix is stable if and only if it can be written as , where , and (that is, is positive semidefinite and is positive definite). This reformulation results in an equivalent optimization problem with a simple convex feasible set. We propose three strategies to solve the problem in variables : (i) a block coordinate descent method, (ii) a projected gradient descent method, and (iii) a fast gradient method inspired from smooth convex optimization. These methods require operations per iteration, where is the size of . We show the effectiveness of the fast gradient method compared to the other approaches and to several state-of-the-art algorithms.
21 pages, 5 figures, 4 tables. Some typos and errors fixed, new remark on uniqueness issues
References in corpus (1)
Cited by in corpus (14)
- Finding the nearest positive-real system
- Approximating the nearest stable discrete-time system
- Computing nearest stable matrix pairs
- Model reduction for linear systems with low-rank switching
- A note on approximating the nearest stable discrete-time descriptor system with fixed rank
- A semi-analytical approach for the positive semidefinite Procrustes problem
- On approximating the nearest Ω-stable matrix
- 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
- Riemannian optimal model reduction of stable linear systems
- Characterization of the dissipative mappings and their application to perturbations of dissipative-Hamiltonian systems
- Optimal Graph Laplacian
- Stabilising the Metzler matrices with applications to dynamical systems