Abstract
Recently Rohn and Poljak proved that for interval matrices with rank-one radius matrices testing singularity is NP-complete. This paper will show that given any matrix family belonging to the class of matrix polytopes with hypercube domains and rank-one perturbation matrices, a class which contains the interval matrices, testing singularity reduces to testing whether a certain matrix is not a P-matrix. It follows from this result that the problem of testing whether a given matrix is a P-matrix is co-NP-complete.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Rohn, “Systems of linear interval equations,”Linear Algebra and Its Applications 126 (1989) 39–78.
S. Poljak and J. Rohn, “Checking robust nonsingularity is NP-hard,”Mathematics of Control, Signals and Systems, 6 (1993) 1–9.
M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman and Co., New York, 1979).
F.R. Gantmacher,The Theory of Matrices, vol. I (Chelsea Publishing Company, New York, 1959).
M. Fiedler and V. Ptak, “On matrices with non-positive off-diagonal elements and positive principal minors,”Czechoslovakian Journal of Mathematics 12 (1962) 382–400.
K.G. Murty,Linear Complementarity, Linear and Nonlinear Programming (Heldermann Verlag, Berlin, 1988).
J. Demmel, “The componentwise distance to the nearest singular matrix,”SIAM Journal of Matrix Analysis and Applications 13 (1992) 10–19.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Coxson, G.E. The P-matrix problem is co-NP-complete. Mathematical Programming 64, 173–178 (1994). https://doi.org/10.1007/BF01582570
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582570