A copositivity probe
A real symmetric matrix \(A\) of order \(p\) is said to be copositive if \(x^TAx \geq 0\) for \(x \geq 0\) (strictly copositive if it is copositive and equality holds only for \(x=0\)). The aim of the paper is to find whether a real symmetric matrix \(A\) is equal to the sum of a positive semidefinite matrix \(S\) and a nonnegative matrix \(P\). Every such matrix \(A\) is copositive and it is strictly copositive if \(S\) is positive definite. NEWLINENEWLINENEWLINEA very simple algorithm based on the perturbation theory of eigenvalues and eigenvectors in quantum mechanics is used here. It is shown that if a tested matrix \(A\) is not copositive then in many such cases the algorithm produces a proof that \(A\) is not copositive by producing a positive vector \(v\) such that \(v^TAv < 0\). This byproduct increases the value of the procedure. If the procedure succeeds, one has a proof of copositivity and if it fails and produces the mentioned vector \(v\), one has a proof of noncopositivity.
- A test for copositive matrices
- Criteria for copositive matrices
- Criteria for copositive matrices using simplices and barycentric coordinates
- Extreme copositive quadratic forms
- Extreme copositive quadratic forms
- Extreme copositive quadratic forms. II
- scientific article; zbMATH DE number 3176168 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 1324221 (Why is no real title available?)
- scientific article; zbMATH DE number 1182565 (Why is no real title available?)
- scientific article; zbMATH DE number 3201668 (Why is no real title available?)
- scientific article; zbMATH DE number 3239038 (Why is no real title available?)
- Is the Frequency Theory of Probability Adequate for All Scientific Purposes?
- On classes of copositive matrices
- Role of copositivity in optimality criteria for nonconvex optimization problems
- Some NP-complete problems in quadratic and nonlinear programming
- Using copositivity for global optimality criteria in concave quadratic programming problems
- Criteria for copositive matrices of order four
- A test for copositive matrices
- Quadratic-programming criteria for copositive matrices
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Gaddum's test for symmetric cones
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- A new certificate for copositivity
- Algorithmic copositivity detection by simplicial partition
- The copositive completion problem
- Criteria for copositive matrices
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- Criteria for copositive matrices
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Linear-Time Copositivity Detection for Tridiagonal Matrices and Extension to Block-Tridiagonality
- On the generalized inverse of a copositive matrix
- Foundations of set-semidefinite optimization
- scientific article; zbMATH DE number 2205665 (Why is no real title available?)
- An LP-based algorithm to test copositivity
- Copositivity tests based on the linear complementarity problem
- An algorithm for determining copositive matrices
- The copositive range
- Perron-Frobenius property of copositive matrices, and a block copositivity criterion
- Algorithms for determining the copositivity of a given symmetric matrix
- A note on algorithms for determining the copositivity of a given symmetric matrix
This page was built for publication: A copositivity probe
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954132)
