Paper Info
Title
Representing quadratically constrained quadratic programs as generalized copositive programs.
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.
Year
DOI
Venue
2012
10.1016/j.orl.2012.02.001
Operations Research Letters
Keywords
Field
DocType
Conic programming,Copositive programming,Quadratically constrained quadratic programs
Second-order cone programming,Quadratic growth,Combinatorics,Mathematical optimization,Quadratically constrained quadratic program,Matrix (mathematics),Positive-definite matrix,Quadratic equation,Quadratic programming,Mathematics,Constrained optimization
Journal
Volume
Issue
ISSN
40
3
0167-6377
Citations 
PageRank 
References 
19
0.79
11
Authors
2
Name
Order
Citations
PageRank
Samuel Burer1114873.09
Hongbo Dong2515.55