T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization

Hiroki Marumo, Sunyoung Kim, Makoto Yamashita

We study T-semidefinite programming (SDP) relaxation for constrained polynomial optimization problems (POPs). T-SDP relaxation for unconstrained POPs was introduced by Zheng, Huang…