Generating extreme copositive matrices near matrices obtained from COP-irreducible graphs
As a main goal of the paper under review is to present an algorithmic procedure for obtaining new families of extremal copositive matrices.\N\NWe recall that a real symmetric \(n\times n\) matrix \(A\) is called copositive if \(\langle Ax,x\rangle\geq 0\) for all \(n\)-tuples of non-negative coordinates. These matrices are completely different from positive semidefinite matrices, and are harder to generate.\NAn important application of copositive matrices can be seen in optimization. However, dealing with these matrices is not as easy as expected.\N\NA copositive matrix is called an extreme point (or extreme element) for the copositive cone (consisting of all copositive matrices of a certain size) is a copositive matrix that cannot lie on the line segment joining any two different copositive matrices.\N\NExtremal copositive matrices have their own applications. In fact, optimization problems revolve about extremal points generally.\NThis is where this paper excels in, where a systematic approach is presented to construct extremal copositive matrices.\NThe obtained results are of significant importance in this field of research, and much further applications of them is expected to be seen in future work by interested researchers.
- 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
- scientific article; zbMATH DE number 3176168 (Why is no real title available?)
- New lower bounds and asymptotics for the cp-rank
- On copositive matrices with -1, 9, 1 entries
- 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
- On the DJL conjecture for order 6
- 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)
