Copositivity meets D. C. optimization
DOI10.3934/JDG.2021022zbMATH Open1486.90146OpenAlexW3192375414MaRDI QIDQ2068809FDOQ2068809
Authors: Abdellatif Moudafi, Paul-Emile Maingé
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
Recommendations
- Testing copositivity with the help of difference-of-convex optimization
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Copositive matrices, copositive programming, and applications
- Copositivity aspects of standard quadratic optimization problems
critical pointcopositive matricesDC optimizationdifference of convex functionsproximal-gradient algorithm
Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Convex programming (90C25)
Cites Work
- Signal Recovery by Proximal Forward-Backward Splitting
- Title not available (Why is that?)
- A variational approach to copositive matrices
- On the convergence of an approximate proximal method for DC functions
- Title not available (Why is that?)
- 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
Cited In (2)
This page was built for publication: Copositivity meets D. C. optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2068809)