Completely Positive Reformulations of Polynomial Optimization Problems with Linear Inequality Constraints
Polynomial optimization encompasses a broad class of problems in which both the objective function and constraints are polynomial functions of the decision variables. In recent years, a substantial body of research has focused on reformulating polynomial optimization problems (POPs) as conic programs over the cone of completely...