Generating extreme copositive matrices near matrices obtained from COP-irreducible graphs
From MaRDI portal
Publication:6536723
Recommendations
Cites work
- scientific article; zbMATH DE number 3176168 (Why is no real title available?)
- A new certificate for copositivity
- Approximation of the stability number of a graph via copositive programming
- Considering copositivity locally
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Copositive optimization -- recent developments and applications
- Copositive realxation for genera quadratic programming
- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- Extreme copositive quadratic forms
- Extreme copositive quadratic forms
- Generating irreducible copositive matrices using the stable set problem
- Geometry of the copositive and completely positive cones
- New lower bounds and asymptotics for the cp-rank
- On copositive matrices with -1, 9, 1 entries
- On the DJL conjecture for order 6
- On the algebraic structure of the copositive cone
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Open problems in the theory of completely positive and copositive matrices
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Some NP-complete problems in quadratic and nonlinear programming
- The extreme rays of the \(6\times 6\) copositive cone
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Two remarks on copositive matrices
This page was built for publication: Generating extreme copositive matrices near matrices obtained from COP-irreducible graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536723)
