Article ID Journal Published Year Pages File Type
1142509 Operations Research Letters 2012 4 Pages PDF
Abstract

We show that any (nonconvex) quadratically constrained quadratic program (QCQP) can be represented as a generalized copositive program. In fact, we provide two representations: one based on the concept of completely positive (CP) matrices over second-order cones, and one based on CP matrices over the positive semidefinite cone.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Representing quadratically constrained quadratic programs as generalized copositive programs
Authors
, ,