On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound
From MaRDI portal
Publication:5294584
DOI10.1137/040617340zbMath1123.93035MaRDI QIDQ5294584
No author found.
Publication date: 25 July 2007
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10044/1/536
robust control; Toeplitz matrices; convex relaxation; structured singular value; \(\mu\)-analysis; structured uncertainty; distance to singularity
93B35: Sensitivity (robustness)
93B36: (H^infty)-control
93B11: System structure simplification
93B28: Operator-theoretic methods
Related Items
An explicit state-space solution to the one-block super-optimal distance problem, An improved lower bound and approximation algorithm for binary constrained quadratic programming problem, New bounds on the unconstrained quadratic integer programming problem, Nearest common root of a set of polynomials: a structured singular value approach