Copositivity meets D. C. optimization
From MaRDI portal
Publication:2068809
DOI10.3934/jdg.2021022zbMath1486.90146OpenAlexW3192375414MaRDI QIDQ2068809
Paul-Emile Maingé, Abdellatif Moudafi
Publication date: 20 January 2022
Published in: Journal of Dynamics and Games (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jdg.2021022
difference of convex functionscritical pointcopositive matricesDC optimizationproximal-gradient algorithm
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Testing copositivity with the help of difference-of-convex optimization
- Correction to: ``Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm
- A Variational Approach to Copositive Matrices
- Signal Recovery by Proximal Forward-Backward Splitting
This page was built for publication: Copositivity meets D. C. optimization
