An improved algorithm to test copositivity (Q427387): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Q587678 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15A63 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15B48 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C69 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C09 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C22 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6046180 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
copositivity of a matrix | |||
Property / zbMATH Keywords: copositivity of a matrix / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
testing | |||
Property / zbMATH Keywords: testing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
maximum clique problem | |||
Property / zbMATH Keywords: maximum clique problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
partitioning strategy | |||
Property / zbMATH Keywords: partitioning strategy / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
semidefinite programming | |||
Property / zbMATH Keywords: semidefinite programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithm | |||
Property / zbMATH Keywords: algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
numerical results | |||
Property / zbMATH Keywords: numerical results / rank | |||
Normal rank |
Revision as of 23:05, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An improved algorithm to test copositivity |
scientific article |
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