Copositivity meets D. C. optimization

<p style='text-indent:20px;'>Based on a work by M. Dur and J.-B. Hiriart-Urruty[<xref ref-type="bibr" rid="b3">3</xref>], we consider the problem of whether a symmetric matrix is copositive formulated as a difference of convex functions problem. The convex nondifferentiable function in this d.c. decomposition being proximable, we then apply a proximal-gradient method to approximate the related stationary points. Whereas, in [<xref ref-type="bibr" rid="b3">3</xref>], the DCA algorithm was used.</p>