Pages that link to "Item:Q1802197"
From MaRDI portal
The following pages link to Checking robust nonsingularity is NP-hard (Q1802197):
Displaying 43 items.
- Relations between various methods for solving linear interval and parametric equations (Q2419042) (← links)
- Sufficient regularity conditions for complex interval matrices and approximations of eigenvalues sets (Q2422841) (← links)
- How to determine basis stability in interval linear programming (Q2439525) (← links)
- A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value (Q2443367) (← links)
- Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction (Q2512100) (← links)
- Randomized algorithms for robust controller synthesis using statistical learning theory: a tutorial overview (Q2512151) (← links)
- A new vertex result for robustness problems with interval matrix uncertainty (Q2519738) (← links)
- The maximum row length nonsingularity radius (Q2564958) (← links)
- Eigenvectors of interval matrices over max--plus algebra (Q2565846) (← links)
- How strong is strong regularity? (Q2568637) (← links)
- On distributional robustness of systems with complex uncertainty (Q2643482) (← links)
- Mixed robustness: analysis of systems with uncertain deterministic and random parameters by the example of linear systems (Q2660534) (← links)
- Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem (Q2660610) (← links)
- Generalized eigenvalue for even order tensors via Einstein product and its applications in multilinear control systems (Q2678847) (← links)
- Structured singular value approach for systems with parametric uncertainty (Q2730992) (← links)
- Tight Bounds on the Radius of Nonsingularity (Q2803591) (← links)
- Guardian map approach to robust stability of interval systems (Q2935129) (← links)
- Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach (Q3458169) (← links)
- Linear Programming with Inexact Data is NP‐Hard (Q4228409) (← links)
- Checking positive definiteness or stability of symmetric interval matrices is NP-hard (Q4325575) (← links)
- Almost Sharp Bounds for the Componentwise Distance to the Nearest Singular Matrix (Q4342149) (← links)
- Computing the norm ∥<i>A</i>∥∞,1 is NP-hard<sup>∗</sup> (Q4498326) (← links)
- On Relation Between P-Matrices and Regularity of Interval Matrices (Q4554517) (← links)
- Regularity radius: Properties, approximation and a not a priori exponential algorithm (Q4615523) (← links)
- Tolerances, robustness and parametrization of matrix properties related to optimization problems (Q4634170) (← links)
- A theorem of the alternatives for the equation<i>Ax</i>+<i>B</i>|<i>x</i>| =<i>b</i> (Q4655433) (← links)
- Minimum phase robustness for uncertain state-space systems (Q4827684) (← links)
- A note on checking regularity of interval matrices (Q4854477) (← links)
- Checking nonsingularity of tridiagonal matrices (Q4933757) (← links)
- On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation (Q5219689) (← links)
- Worst‐case stability and performance with mixed parametric and dynamic uncertainties (Q5739105) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- On solving vague systems of linear equations with pattern-shaped columns (Q5929747) (← links)
- Positively regular vague matrices (Q5932203) (← links)
- NP-hardness of the stable matrix in unit interval family problem in discrete time (Q5940880) (← links)
- Randomized algorithms for robust controller synthesis using statistical learning theory (Q5947623) (← links)
- Probabilistic solutions to some NP-hard matrix problems (Q5947649) (← links)
- Calculation of exact bounds for the solution set of linear interval systems (Q5961705) (← links)
- Verified error bounds for multiple roots of systems of nonlinear equations (Q5962124) (← links)
- Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control'' (Q5966130) (← links)
- Letter to the editor (Q5971271) (← links)
- Performance and accuracy of the basic closure algorithm of quadrature-based moment methods (Q6087931) (← links)
- On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods (Q6137809) (← links)
