An improved algorithm to test copositivity |
| |
Authors: | Julia Sponsel Stefan Bundfuss Mirjam Dür |
| |
Affiliation: | (3) University of Vienna, Vienna, Austria; |
| |
Abstract: | Copositivity plays a role in combinatorial and nonconvex quadratic optimization. However, testing copositivity of a given matrix is a co-NP-complete problem. We improve a previously given branch-and-bound type algorithm for testing copositivity and discuss its behavior in particular for the maximum clique problem. Numerical experiments indicate that the speedup is considerable. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |