Recommendations
Cites work
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- A solvable case of quadratic 0-1 programming
- Complexity of Partial Satisfaction
- Facets for the cut cone. I
- scientific article; zbMATH DE number 4013856 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 4193718 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Laplacian eigenvalues and the maximum cut problem
- Minimization of ±1 matrices under line shifts
- Systems of linear interval equations
- Tournament Ranking with Expected Profit in Polynomial Time
Cited in
(96)- On computational complexity of invalidating structured uncertainty models
- On the complexity of the robust stability problem for linear parameter varying systems
- Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis
- Several NP-hard problems arising in robust stability analysis
- The P-matrix problem is co-NP-complete
- Helly-type theorems and generalized linear programming
- Enclosing solutions of linear interval equations is NP-hard
- Inversion error, condition number, and approximate inverses of uncertain matrices
- Static output feedback -- a survey
- Complexity issues in robust stability of linear delay-differential systems
- Theorems of Perron-Frobenius type for matrices without sign restrictions
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- The boundedness of all products of a pair of matrices is undecidable
- A characterization of convex cones of matrices with constant regular inertia
- A probabilistic framework for problems with real structured uncertainty in systems and control
- Real eigenvalue bounds of standard and generalized real interval eigenvalue problems
- A survey of extreme point results for robustness of control systems
- Componentwise pseudospectrum of a matrix
- A pair of matrices sharing common Lyapunov solutions--A closer look
- On \(P\)-matrices
- Worst-case and average \(\mathcal{H}_2\) performance analysis against real constant parametric uncertainty
- Checking bounds on solutions of linear interval equations is NP-hard
- The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
- A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems
- Approximate linear algebra is intractable
- Checking robust nonsingularity of tridiagonal matrices in linear time
- Rank one interval enclosure of the parametric united solution set
- Linear interval parametric approach to testing pseudoconvexity
- Stability of the linear complementarity problem properties under interval uncertainty
- Complexity of computing interval matrix powers for special classes of matrices.
- Computing the spectral decomposition of interval matrices and a study on interval matrix powers
- On the complexity of matrix rank and rigidity
- Low-rank matrix approximation in the infinity norm
- Computing lower rank approximations of matrix polynomials
- On the stability of a convex set of matrices
- A survey of randomized algorithms for control synthesis and performance verification
- Relations between various methods for solving linear interval and parametric equations
- Sufficient regularity conditions for complex interval matrices and approximations of eigenvalues sets
- How to determine basis stability in interval linear programming
- A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value
- Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction
- Randomized algorithms for robust controller synthesis using statistical learning theory: a tutorial overview
- A new vertex result for robustness problems with interval matrix uncertainty
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- The maximum row length nonsingularity radius
- Eigenvectors of interval matrices over max--plus algebra
- How strong is strong regularity?
- On distributional robustness of systems with complex uncertainty
- Mixed robustness: analysis of systems with uncertain deterministic and random parameters by the example of linear systems
- Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem
- Generalized eigenvalue for even order tensors via Einstein product and its applications in multilinear control systems
- Regularity radius and real eigenvalue range
- Structured singular value approach for systems with parametric uncertainty
- Radii of solvability and unsolvability of linear systems
- Tight bounds on the radius of nonsingularity
- Guardian map approach to robust stability of interval systems
- Checking strict positivity of Kraus maps is NP-hard
- Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach
- Linear Programming with Inexact Data is NP‐Hard
- A note on regularity and positive definiteness of interval matrices
- scientific article; zbMATH DE number 733109 (Why is no real title available?)
- Almost Sharp Bounds for the Componentwise Distance to the Nearest Singular Matrix
- Computing the norm ∥A∥∞,1 is NP-hard∗
- Fast interval matrix multiplication
- On Relation Between P-Matrices and Regularity of Interval Matrices
- Regularity radius: properties, approximation and a not a priori exponential algorithm
- Tolerances, robustness and parametrization of matrix properties related to optimization problems
- A theorem of the alternatives for the equationAx+B|x| =b
- Minimum phase robustness for uncertain state-space systems
- A note on checking regularity of interval matrices
- Checking nonsingularity of tridiagonal matrices
- Branch and bound algorithm with applications to robust stability
- On the complexity of robust PCA and \(\ell_1\)-norm low-rank matrix approximation
- Worst-case stability and performance with mixed parametric and dynamic uncertainties
- A survey of computational complexity results in systems and control
- On solving vague systems of linear equations with pattern-shaped columns
- Positively regular vague matrices
- NP-hardness of the stable matrix in unit interval family problem in discrete time
- Randomized algorithms for robust controller synthesis using statistical learning theory
- Probabilistic solutions to some NP-hard matrix problems
- Calculation of exact bounds for the solution set of linear interval systems
- Verified error bounds for multiple roots of systems of nonlinear equations
- Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control
- Letter to the editor
- Performance and accuracy of the basic closure algorithm of quadrature-based moment methods
- On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods
- An algorithm for addressing the real interval eigenvalue problem
- Strong NP-completeness of a matrix similarity problem
- A theorem of the alternatives for the equation \(|Ax|-|B||x|=b\)
- Global sensitivity analysis and robustness in linear programming using different norms
- Computational complexity of decomposing a symmetric matrix as a sum of positive semidefinite and diagonal matrices
- Range of optimal values in absolute value linear programming with interval data
- Basis stability in interval quadratic programming
- Regularity of interval matrices and theorems of the alternatives
- Nonsingularity, positive definiteness, and positive invertibility under fixed-point data rounding.
- On the computation of structured singular values and pseudospectra
This page was built for publication: Checking robust nonsingularity is NP-hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802197)
