An algorithm for determining copositive matrices
Authors:
Preprint
Abstract
In this paper, we present an algorithm of simple exponential growth called COPOMATRIX for determining the copositivity of a real symmetric matrix. The core of this algorithm is a decomposition theorem, which is used to deal with simplicial subdivision of $\hat{T}^{-}=\{y\in \Delta_{m}| \beta^Ty\leq 0\}$ on the standard simplex $\Delta_m$, where each component of the vector $\beta$ is -1, 0 or 1.
Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Foundations of Set-Semidefinite Optimization2009
- On the copositive representation of binary and continuous nonconvex quadratic programsMathematical Programming, 2008
- Recent advances in automated theorem proving on inequalitiesJournal of Computer Science and Technology, 1999
- Role of copositivity in optimality criteria for nonconvex optimization problemsJournal of Optimization Theory and Applications, 1992
- Some NP-complete problems in quadratic and nonlinear programmingMathematical Programming, 1987
- On copositive matricesLinear Algebra and its Applications, 1983
- Finite criteria for conditional definiteness of quadratic formsLinear Algebra and its Applications, 1981
- Copositive matrices and definiteness of quadratic forms subject to homogeneous linear inequality constraintsLinear Algebra and its Applications, 1981
- On classes of copositive matricesLinear Algebra and its Applications, 1970
- Two remarks on compositive matricesLinear Algebra and its Applications, 1969