A lower bound for the mixed μ problem

DOI10.1109/9.553696zbMATH Open0878.93021OpenAlexW1502888586MaRDI QIDQ3124451FDOQ3124451

Peter M. Young, John C. Doyle

Publication date: 5 January 1998

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://authors.library.caltech.edu/93860/

Recommendations

• Computing bounds for the mixed μ problem
• Properties of the mixed μ problem and its bounds
• Lower bounds on the Münchhausen problem
• A lower-bound of a multiplicative combination approximation
• A lower bound on the rank of mixing extensions
• A lower bound in the \(abc\) conjecture
• Lower bounds for Turán's problem
• A lower bound on solutions of Chartrand's problem
• A gain-based lower bound algorithm for real and mixed \(\mu \) problems
• A Lower Bound for the Scholz-Brauer Problem

zbMATH Keywords

robust stabilitymixed structured singular valuenonconcave real eigenvalue maximization

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Eigenvalue problems (93B60) Robust stability (93D09)

Cited In (9)

• Development of a skewμ upper bound
• Computing bounds for the mixed μ problem
• Development of a skew µ lower bound
• A gain-based lower bound algorithm for real and mixed \(\mu \) problems
• Worst‐case stability and performance with mixed parametric and dynamic uncertainties
• Computation of the real structured singular value via pole migration
• Theories for design and analysis of robust \(H_\infty/H_-\) fault detectors
• A non‐smooth lower bound on ν
• Structured singular value approach for systems with parametric uncertainty

This page was built for publication: A lower bound for the mixed μ problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3124451)