Algorithms for determining the copositivity of a given symmetric matrix
From MaRDI portal
Recommendations
Cites work
- A copositivity probe
- A test for copositive matrices
- Copositive matrices and Simpson's paradox
- Criteria for copositive matrices
- Criteria for copositive matrices using simplices and barycentric coordinates
- On copositive matrices
- Quadratic-programming criteria for copositive matrices
- Some NP-complete problems in quadratic and nonlinear programming
- Spectral theory of copositive matrices
- The copositive completion problem
Cited in
(16)- New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions
- A note on algorithms for determining the copositivity of a given symmetric matrix
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- On sparsity of the solution to a random quadratic optimization problem
- On monotonicity and search strategies in face-based copositivity detection algorithms
- Criteria for copositive matrices of order four
- Sparse solutions to random standard quadratic optimization problems
- scientific article; zbMATH DE number 4174235 (Why is no real title available?)
- Criteria for copositive matrices
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- Optimality conditions for linear copositive programming problems with isolated immobile indices
- A copositivity probe
- An algorithm for determining copositive matrices
- Quadratic-programming criteria for copositive matrices
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
This page was built for publication: Algorithms for determining the copositivity of a given symmetric matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q959864)