nonconvex quadratic programming with bivalent variables

We prove a sufficient global optimality condition for quadratic optimization with quadratic constraints where the variables are allowed to take -1 and 1 values. We extend the condition to quadratic programs with matrix variables and orthogonality conditions, and in particular, to the quadratic assignment problem. CitationBilkent University Technical Report, September 2002.ArticleDownload View PDF