Semidefinite Programming Relaxations Through Quadratic Reformulation for Box-Constrained Polynomial Optimization Problems

doi 10.1109/codit.2019.8820690
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE