A new certificate for copositivity
From MaRDI portal
Publication:2418975
DOI10.1016/j.laa.2018.12.025zbMath1414.15042OpenAlexW2909680587MaRDI QIDQ2418975
Publication date: 29 May 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2018.12.025
Related Items
An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix ⋮ Performance comparison of two recently proposed copositivity tests ⋮ Testing copositivity via mixed-integer linear programming ⋮ The extreme rays of the \(6\times 6\) copositive cone
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SPN completable graphs
- Moment approximations for set-semidefinite polynomials
- Scaling relationship between the copositive cone and Parrilo's first level approximation
- Minimal zeros of copositive matrices
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Geometry of the copositive and completely positive cones
- Linear inequalities and quadratic forms
- Criteria for copositive matrices of order four
- A test for copositive matrices
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On copositive matrices
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- On copositive matrices with -1, 9, 1 entries
- On an extension of Pólya's Positivstellensatz
- On the exhaustivity of simplicial partitioning
- Algorithmic copositivity detection by simplicial partition
- Extreme copositive quadratic forms
- Two remarks on copositive matrices
- Irreducible elements of the copositive cone
- Copositive Programming
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- Some NP-complete problems in quadratic and nonlinear programming
- On a Conjecture of L. J. Mordell Regarding an Inequality Involving Quadratic Forms
- On the Matrix Equation X′X = A
- Copositive realxation for genera quadratic programming
- Extremal copositive matrices with minimal zero supports of cardinality two
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- On cliques in graphs
- Considering copositivity locally
