Computing the distance to uncontrollability via LMIs: lower bound computation with exactness verification
From MaRDI portal
Publication:2519756
DOI10.1016/j.sysconle.2008.03.002zbMath1153.93004OpenAlexW2089200142MaRDI QIDQ2519756
Publication date: 27 January 2009
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/85170
Controllability (93B05) Linear systems in control theory (93C05) Pole and zero placement problems (93B55) Eigenvalues, singular values, and eigenvectors (15A18) Control/observation systems governed by ordinary differential equations (93C15)
Related Items (4)
On the assignability of LTI systems with arbitrary control structures ⋮ The feedback search algorithm: estimating the distance of semi-explicit systems to \(\mathcal{R}\)-uncontrollability ⋮ Robust controllability assessment via semi-definite programming ⋮ Robust controllability assessment and optimal actuator placement in dynamic networks
Uses Software
Cites Work
- Between controllable and uncontrollable
- On the Kalman-Yakubovich-Popov lemma
- An analysis of the pole placement problem. II: The multi-input case
- The complex structured singular value
- LMI relaxations in robust control
- Fast Methods for Estimating the Distance to Uncontrollability
- Generalized $\mathcal{S}$-Procedure for Inequality Conditions on One-Vector-Lossless Sets and Linear System Analysis
- Properties of numerical algorithms related to computing controllability
- Linear Matrix Inequalities in System and Control Theory
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Rank-one LMIs and Lyapunov's inequality
- Pseudospectral Components and the Distance to Uncontrollability
- A Convex Approach to Robust Stability for Linear Systems with Uncertain Scalar Parameters
- New Methods for Estimating the Distance to Uncontrollability
- Positive polynomials and robust stabilization with fixed-order controllers
- Semidefinite programming duality and linear time-invariant systems
- Generalized KYP lemma: unified frequency domain inequalities with design applications
- Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
- Generalized \(S\)-procedure and finite frequency KYP lemma
This page was built for publication: Computing the distance to uncontrollability via LMIs: lower bound computation with exactness verification
