Could someone tell me the time complexity of a convex quadratically constrained quadratic program (QCQP)? Any references? 



Complexity of convex quadratically constrained quadratic programming (QCQP)
According to the Wikipedia article at <http://en.wikipedia.org/wiki/NP-hard> it is NP-hard. The Wikipedia article gives as a reference a book which is available at <http://www.stanford.edu/~boyd/cvxbook/>


