An improved algorithm to test copositivity (Q427387)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6046180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved algorithm to test copositivity |
scientific article; zbMATH DE number 6046180 |
Statements
An improved algorithm to test copositivity (English)
0 references
13 June 2012
0 references
This paper deals with testing the copositivity of a matrix. Some previous copositivity conditions presented by \textit{S. Bundfuss} and \textit{M. Dür} [Linear Algebra Appl. 428, No. 7, 1511--1523 (2008; Zbl 1138.15007)] are generalized. These results naturally yield a modified algorithm to test whether a matrix is copositive or not. Then the authors focus on the behavior of the modified algorithm when applied to the maximum clique problem. Theoretical and numerical results demonstrate that the behavior of the new algorithm highly depends on the partitioning strategy.
0 references
copositivity of a matrix
0 references
testing
0 references
maximum clique problem
0 references
partitioning strategy
0 references
semidefinite programming
0 references
algorithm
0 references
numerical results
0 references
0 references
0 references
0 references
0.8815918564796448
0 references
0.8741596341133118
0 references
0.8622880578041077
0 references
0.8247318267822266
0 references
