A modified simplex partition algorithm to test copositivity
From MaRDI portal
Publication:2052385
Recommendations
Cites work
- Algorithmic copositivity detection by simplicial partition
- An LP-based algorithm to test copositivity
- An improved algorithm to test copositivity
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- Evolution towards the maximum clique
- On copositive programming and standard quadratic optimization problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the exhaustivity of simplicial partitioning
- Some NP-complete problems in quadratic and nonlinear programming
Cited in
(7)- An LP-based algorithm to test copositivity
- Algorithms for determining the copositivity of a given symmetric matrix
- An improved algorithm to test copositivity
- An algorithm for determining copositive matrices
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- Algorithmic copositivity detection by simplicial partition
- Copositive programming by simplicial partition
This page was built for publication: A modified simplex partition algorithm to test copositivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052385)
