NP-hardness of polytope M-matrix testing and related problems
نویسنده
چکیده
In this note we prove NP-hardness of the following problem: Given a set of matrices, is there a convex combination of those that is a nonsingular M-matrix? Via known characterizations of M-matrices, our result establishes NP-hardness of several fundamental problems in systems analysis and control, such as testing the instability of an uncertain dynamical system, and minimizing the spectral radius of an affine matrix function.
منابع مشابه
Packing Segments in a Convex 3-Polytope is NP-hard
We show it is NP-hard to pack the maximum number of segments in a convex 3-dimensional polytope. We show this packing problem is also NP-hard for general polygonal regions in the plane. This problem relates two streams of research, Kakeya set problems and packing problems.
متن کاملContainment Problems for Polytopes and Spectrahedra
We study the computational question whether a given polytope or spectrahedron SA (as given by the positive semidefiniteness region of a linear matrix pencil A(x)) is contained in another one SB . First we classify the computational complexity, extending results on the polytope/polytope-case by Gritzmann and Klee to the polytope/spectrahedron-case. For various restricted containment problems, NP...
متن کاملOn the Computational Hardness of Testing Square-Freeness of Sparse Polynomials
We show that deciding square-freeness of a sparse univariate polynomial over ZZ and over the algebraic closure of a nite eld IFq of p elements is NP-hard. We also discuss some related open problems about sparse polynomials.
متن کاملMembership testing for Bernoulli and tail-dependence matrices
Testing a given matrix for membership in the family of Bernoulli matrices is a longstanding problem, the many applications of Bernoulli vectors in computer science, finance, medicine, and operations research emphasize its practical relevance. A novel approach towards this problem was taken by [Fiebig et al., 2017] for lowdimensional settings d ≤ 6. For the first time, they exploit the close rel...
متن کاملNP-hardness of linear multiplicative programming and related problems
The linear multiplicative programming problem minimizes a product of two (positive) variables subject to linear inequality constraints. In this paper, we show NP-hardness of linear multiplicative programming problems and related problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1206.2059 شماره
صفحات -
تاریخ انتشار 2012