Semidefinite programming relaxations through quadratic reformulation for box-constrained polynomial optimization problems | IEEE Conference Publication | IEEE Xplore