Pages that link to "Item:Q4396072"
From MaRDI portal
The following pages link to On the complexity of purely complex μ computation and related problems in multidimensional systems (Q4396072):
Displayed 16 items.
- Robust control of uncertain systems: classical results and recent developments (Q458745) (← links)
- Approximation methods for complex polynomial optimization (Q742305) (← links)
- On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200) (← links)
- Distributed control design with robustness to small time delays (Q1015769) (← links)
- The boundedness of all products of a pair of matrices is undecidable (Q1583220) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Exploiting sparsity in complex polynomial optimization (Q2073057) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- An alternative Kalman-Yakubovich-Popov lemma and some extensions (Q2391340) (← links)
- Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations (Q2797107) (← links)
- Nonsmooth µ-synthesis (Q3098481) (← links)
- On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization (Q4602339) (← links)
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables (Q4637505) (← links)
- Stability and stabilisation of linear multidimensional discrete systems in the frequency domain (Q5252970) (← links)
- On the stability of 2D state‐space models (Q5397312) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)