New approximations for the cone of copositive matrices and its dual

@article{Lasserre2014NewAF,
  title={New approximations for the cone of copositive matrices and its dual},
  author={Jean B. Lasserre},
  journal={Math. Program.},
  year={2014},
  volume={144},
  pages={265-276}
}
We provide convergent hierarchies for the convex cone C of copositive matrices and its dual C∗, the cone of completely positive matrices. In both cases the corresponding hierarchy consists of nested spectrahedra and provide outer (resp. inner) approximations for C (resp. for its dual C∗), thus complementing previous inner (resp. outer) approximations for C (for C∗). In particular, both inner and outer approximations have a very simple interpretation. Finally, extension to K-copositivity and K… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Copositive programming, in Handbook of Semidefinite

  • S. Burer
  • Conic and Polynomial Optimization,
  • 2012
Highly Influential
4 Excerpts

Linear inequalities and quadratic forms, Pacific

  • J. W. Gaddum
  • J. Math
  • 1958
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…