On the complexity of purely complex μ computation and related problems in multidimensional systems

DOI10.1109/9.661609MaRDI QIDQ4396072zbMATH OpenOpenAlexFDO

Authors H. Özbay, Onur Toker

Publication date 23 August 1998

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

Full work available at URL https://doi.org/10.1109/9.661609

zbMATH Keywords

\({\mathcal N} {\mathcal P}\)-hardcomplex \(\mu\) analysis and synthesiscomputing the \(H^\infty\) normstability

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Sensitivity (robustness) (93B35) (H^infty)-control (93B36) Synthesis problems (93B50)

Recommendations

• Computational complexity of real structured singular value in \(\ell_p\) setting
• The real structured singular value is hardly approximable
• Computational complexity of μ calculation
• A survey of computational complexity results in systems and control

Cited in

(23)

• The complexity of computing the Muirhead-Dalton distance
• Distributed control design with robustness to small time delays
• The boundedness of all products of a pair of matrices is undecidable
• Penalized semidefinite programming for quadratically-constrained quadratic optimization
• Exploiting sparsity in complex polynomial optimization
• Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
• An alternative Kalman-Yakubovich-Popov lemma and some extensions
• Computational complexity of real structured singular value in \(\ell_p\) setting
• Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
• Some results on complexity of -calculus evaluation in the black-box model
• Nonsmooth -synthesis
• The Complexity of Enriched Mu-Calculi
• Computational complexity of μ calculation
• Robust control of uncertain systems: classical results and recent developments
• On the estimation performance and convergence rate of the generalized power method for phase synchronization
• Lasserre hierarchy for large scale polynomial optimization in real and complex variables
• Stability and stabilisation of linear multidimensional discrete systems in the frequency domain
• On the stability of 2D state‐space models
• A survey of computational complexity results in systems and control
• A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients
• \(\hat{H}\)-eigenvalues of Hermitian tensors and some applications
• Approximation methods for complex polynomial optimization
• On approximating complex quadratic optimization problems via semidefinite programming relaxations

This page was built for publication: On the complexity of purely complex μ computation and related problems in multidimensional systems

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