Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258)
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 6160889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision |
scientific article; zbMATH DE number 6160889 |
Statements
Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (English)
0 references
6 May 2013
0 references
The paper introduces difference-of-convex based approaches to copositivity testing. The authors propose an algorithm to detect copositivity of a given symmetric matrix which combines linear programming and convex quadratic programming technology with spectral information. Three copositivity tests are presented. The algorithm either provides a guarantee for copositivity, or delivers a violating vector as a certificate for non-copositivity. For the branch and bound algorithm, the choice of spectral difference-of-convex decomposition and a robustification step are discussed. Some empirical tests results are presented on randomly generated matrices, and checking copositivity on the maximum clique problem.
0 references
conic optimization
0 references
linear optimization
0 references
quadratic optimization
0 references
numerical examples
0 references
copositivity testing
0 references
algorithm
0 references
branch and bound algorithm
0 references
spectral difference-of-convex decomposition
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8176469802856445
0 references
0.8148471117019653
0 references
0.8000015020370483
0 references
0.7819253206253052
0 references
0.7799947261810303
0 references
