On the complexity of purely complex μ computation and related problems in multidimensional systems
From MaRDI portal
Publication:4396072
DOI10.1109/9.661609zbMath0905.93018OpenAlexW2143640815MaRDI QIDQ4396072
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
stability\({\mathcal N} {\mathcal P}\)-hardcomplex \(\mu\) analysis and synthesiscomputing the \(H^\infty\) norm
Analysis of algorithms and problem complexity (68Q25) Sensitivity (robustness) (93B35) (H^infty)-control (93B36) Synthesis problems (93B50) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
An alternative Kalman-Yakubovich-Popov lemma and some extensions, On approximating complex quadratic optimization problems via semidefinite programming relaxations, On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization, Robust control of uncertain systems: classical results and recent developments, On the stability of 2D state‐space models, Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables, A survey of computational complexity results in systems and control, Penalized semidefinite programming for quadratically-constrained quadratic optimization, Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations, Approximation methods for complex polynomial optimization, Distributed control design with robustness to small time delays, Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting, Nonsmooth µ-synthesis, Exploiting sparsity in complex polynomial optimization, The boundedness of all products of a pair of matrices is undecidable, Stability and stabilisation of linear multidimensional discrete systems in the frequency domain
