I was going through Stephen Boyd and lieven vandenberghe's Convex Optimization Book, In chapter 4 he explains Semidefinite programming (SDP) and it's the standard form.
min $c^{T}x$
subject to $x_{1}F_{1} + x_{2}F_{2} +... + x_{n}F_{n} + G <= 0$
I was wondering as SDP is the superset to Quadratic Programming having quadratic objectives should be allowed right?