Real stability radii and quadratic matrix inequality
A problem from robustness analysis is formulated as a parametric optimization problem. Consider the system \(dx/dt= (A+B\theta C)x\) with real matrices, and a fixed open set \(G\) in the complex plane. The system is said to be stable relative to \(G\) if \(G\) contains all eigenvalues of \(A\). Consider the matrix \(\theta\) as a parameter and denote its largest singular value by \(f^0(\theta)\). The authors consider the problem of minimizing \(f^0(\theta)\) so that the system is not \(G\)-stable. Under the linear constraint \(B=\theta A\), the problem reduces to \[ \inf_{\alpha>0} \{\alpha: \alpha^2 A^T A- B^TB\geq 0\}. \]
- scientific article; zbMATH DE number 4200106 (Why is no real title available?)
- scientific article; zbMATH DE number 4079286 (Why is no real title available?)
- When are the complex and the real stability radii equal?
- Explicit formulas for stability radii of nonnegative and Metzlerian matrices
- Optimal stability and eigenvalue multiplicity
- On the real stability radius for some classes of matrices
This page was built for publication: Real stability radii and quadratic matrix inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364950)
