Pages that link to "Item:Q4325575"

The following pages link to Checking positive definiteness or stability of symmetric interval matrices is NP-hard (Q4325575):

Displaying 25 items.

• Checking strict positivity of Kraus maps is NP-hard (Q344532) (← links)
• Enclosure of all index-1 saddle points of general nonlinear functions (Q513158) (← links)
• Testing pseudoconvexity via interval computation (Q721159) (← links)
• Positive definiteness of Hermitian interval matrices (Q846327) (← links)
• Reduced vertex set result for interval semidefinite optimization problems (Q956611) (← links)
• Several NP-hard problems arising in robust stability analysis (Q1312298) (← links)
• Positive-definiteness of interval families of symmetric matrices (Q1883821) (← links)
• Diagonal matrix scaling is NP-hard (Q1908195) (← links)
• Complexity issues for the symmetric interval eigenvalue problem (Q2257476) (← links)
• On the complexity of matrix rank and rigidity (Q2268340) (← links)
• An iterative algorithm for the stability analysis of dynamic interval systems (Q2437212) (← links)
• Determining the positive definiteness margin of interval matrices (Q2481141) (← links)
• Verification of positive definiteness (Q2502318) (← links)
• Eigenvalue range determination for interval and parametric matrices (Q3075933) (← links)
• Determining the range of real eigenvalues for the interval generalized eigenvalue problem (Q3613726) (← links)
• Interval Linear Algebra and Computational Complexity (Q4554518) (← links)
• Determinants of Interval Matrices (Q4615521) (← links)
• Tolerances, robustness and parametrization of matrix properties related to optimization problems (Q4634170) (← links)
• Upper (lower) bounds of the eigenvalues, spread and the open problems for the real symmetric interval matrices (Q4919625) (← links)
• On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability (Q4974461) (← links)
• Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes (Q5885809) (← links)
• A survey of computational complexity results in systems and control (Q5926262) (← links)
• NP-hardness of the stable matrix in unit interval family problem in discrete time (Q5940880) (← 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)