Depth-first simplicial partition for copositivity detection, with an application to MaxClique

作者：Zilinskas Julius^*; Dur Mirjam

来源：Optimization Methods and Software, 2011, 26(3): 499-510.

DOI：10.1080/10556788.2010.544310

• simplicial partition
• copositive matrices
• MaxClique

Detection of copositivity plays an important role in combinatorial and quadratic optimization. Recently, an algorithm for copositivity detection by simplicial partition has been proposed. In this paper, we develop an improved depth-first simplicial partition algorithm which reduces memory requirements significantly and therefore enables copositivity checks of much larger matrices - of size up to a few thousands instead of a few hundreds. The algorithm has been investigated experimentally on a number of MaxClique problems as well as on generated random problems. We present numerical results showing that the algorithm is much faster than a recently published linear algebraic algorithm for copositivity detection based on traditional ideas - checking properties of principal sub-matrices. We also show that the algorithm works very well for solving MaxClique problems through copositivity checks.

• 出版日期2011