AbstractSome finite criteria for copositive, copositive-plus, and strictly copositive matrices are proposed and compared with existing determinantal tests. The basic mathematical tool is principal pivoting
AbstractAn n×n real symmetric matrix A is called (strictly) copositive if xTAx⩾0 (>0) whenever x∈Rn ...
An n × n real symmetric matrix A is called (strictly) copositive if xTAx ⩾ 0 (\u3e0) whenever x ∈ Rn...
A symmetric matrix is called copositive if it generates a quadratic form taking no negative values o...
AbstractSome finite criteria for copositive, copositive-plus, and strictly copositive matrices are p...
AbstractFinding out whether a real symmetric n × n matrix A is not copositive is an NP-complete prob...
AbstractIt is proved that the copositivity of a symmetric matrix of order n is equivalent to the cop...
AbstractA real n × n matrix is termed almost copositive if it is not copositive but all its principa...
AbstractAndersson et al. [L.E. Andersson, G. Chang, T. Elfving, Criteria for copositive matrices usi...
AbstractA criterion for copositive matrices is given and for n = 3 the set of all copositive matrice...
AbstractAndersson et al. [L.E. Andersson, G. Chang, T. Elfving, Criteria for copositive matrices usi...
AbstractThe paper presents necessary and sufficient conditions that a symmetric matrix be copositive...
AbstractFinding out whether a real symmetric n × n matrix A is not copositive is an NP-complete prob...
AbstractThe principal pivoting scheme for quadratic programming is used to derive finite criteria fo...
AbstractA real symmetric n × n matrix Q is A-conditionally positivesemidefinite, where A is a given ...
AbstractA real n × n matrix is termed almost copositive if it is not copositive but all its principa...
AbstractAn n×n real symmetric matrix A is called (strictly) copositive if xTAx⩾0 (>0) whenever x∈Rn ...
An n × n real symmetric matrix A is called (strictly) copositive if xTAx ⩾ 0 (\u3e0) whenever x ∈ Rn...
A symmetric matrix is called copositive if it generates a quadratic form taking no negative values o...
AbstractSome finite criteria for copositive, copositive-plus, and strictly copositive matrices are p...
AbstractFinding out whether a real symmetric n × n matrix A is not copositive is an NP-complete prob...
AbstractIt is proved that the copositivity of a symmetric matrix of order n is equivalent to the cop...
AbstractA real n × n matrix is termed almost copositive if it is not copositive but all its principa...
AbstractAndersson et al. [L.E. Andersson, G. Chang, T. Elfving, Criteria for copositive matrices usi...
AbstractA criterion for copositive matrices is given and for n = 3 the set of all copositive matrice...
AbstractAndersson et al. [L.E. Andersson, G. Chang, T. Elfving, Criteria for copositive matrices usi...
AbstractThe paper presents necessary and sufficient conditions that a symmetric matrix be copositive...
AbstractFinding out whether a real symmetric n × n matrix A is not copositive is an NP-complete prob...
AbstractThe principal pivoting scheme for quadratic programming is used to derive finite criteria fo...
AbstractA real symmetric n × n matrix Q is A-conditionally positivesemidefinite, where A is a given ...
AbstractA real n × n matrix is termed almost copositive if it is not copositive but all its principa...
AbstractAn n×n real symmetric matrix A is called (strictly) copositive if xTAx⩾0 (>0) whenever x∈Rn ...
An n × n real symmetric matrix A is called (strictly) copositive if xTAx ⩾ 0 (\u3e0) whenever x ∈ Rn...
A symmetric matrix is called copositive if it generates a quadratic form taking no negative values o...
DOI
Add to ORKG