Copositivity meets D. C. optimization
- 1 January 2022
- journal article
- research article
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Dynamics and Games
- Vol. 9 (1) , 27-32
Abstract
Based on a work by M. Dur and J.-B. Hiriart-Urruty[3], 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 [3], the DCA algorithm was used.Keywords
This publication has 5 references indexed in Scilit:
- Global convergence of a proximal linearized algorithm for difference of convex functionsOptimization Letters, 2015
- Testing copositivity with the help of difference-of-convex optimizationMathematical Programming, 2013
- A Variational Approach to Copositive MatricesSIAM Review, 2010
- Signal Recovery by Proximal Forward-Backward SplittingMultiscale Modeling & Simulation, 2005
- Convex Analysis and Minimization Algorithms I1993