DC Decomposition of Nonconvex Polynomials with Algebraic Techniques

10/06/2015
by   Amir Ali Ahmadi, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset