ISMP 2015 Presentation, at Pittsburgh, PA, Monday, July 13, 2015:

Title: DC Decomposition of Nonconvex Polynomials with Algebraic Techniques 

Abstract: The concave-convex procedure is a majorization-minimization algorithm for difference of convex (DC) optimization, where the constraints and the objective function are given as the difference of two convex functions. Although several important problems (e.g., in machine learning) already appear in DC form, such a decomposition is...

Read more about ISMP 2015 Presentation