# zbMATH — the first resource for mathematics

On copositive programming and standard quadratic optimization problems. (English) Zbl 0970.90057
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.

##### MSC:
 90C20 Quadratic programming 90C51 Interior-point methods 90C22 Semidefinite programming
Full Text: