We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows us to optimize over subsets of valid difference of convex decompositions (dcds) and find ones that speed up the convex-concave procedure (CCP). We prove, however, that optimizing over the entire set of dcds is NP-hard.

## Citation

ORFE, Sherrerd Hall, Princeton University, Princeton, NJ 08540; October 2015

## Article

View DC Decomposition of Nonconvex Polynomials with Algebraic Techniques