On copositive programming and standard quadratic optimization problems (Q5929997): Difference between revisions

The authors consider quadratic optimization problems of the form \[ x^TAx\to \text{maximum subject to }x\in\Delta \] where \(A\) is an arbitrary symmetric \(n\times n\) matrix and \(\Delta\) is the standard simpiex in the \(n\)-dimensional Euclidean space \(\mathbb{R}^n\), \(\Delta= \{x\in R^n_+: e^Tx=1\}\). Using the special structure of quadratic problems, the authors apply an interior-point method to an extension of semidefinite programming called copositive programming.