Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Triangle-free graphs and completely positive matrices

  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

Completely positive matrices are matrices that can be decomposed as \(BB^T\), where B is an entrywise nonnegative matrix. These matrices have many applications, including applications to optimization. This article is a survey of some results in the theory of completely positive matrices that involve matrices whose graph contains no triangles.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ando T (1991) Completely positive matrices. The University of Wisconsin, Madison, Lecture notes

  • Berman A, Dür M, Shaked-Monderer N, Witzel J (2016) Cutting planes for semidefinite relaxations based on triangle-free subgraphs. Optimiz Lett 10(3):433–446

    Article  Google Scholar 

  • Berman A, Hershkowitz D (1987) Combinatorial results on completely positive matrices. Linear Algebra Appl 95:111–125

    Article  Google Scholar 

  • Berman A, Shaked-Monderer N (1998) Remarks on completely positive matrices. Linear Multilinear Algebra 44(2):149–163

    Article  Google Scholar 

  • Berman A, Shaked-Monderer N (2003) Completely positive matrices. World Scientific Publishing Co. Inc, River Edge, NJ

    Book  Google Scholar 

  • Bomze IM (2012) Copositive optimization-recent developments and applications. Eur J Oper Res 216(3):509–520

    Article  Google Scholar 

  • Bomze IM, Schachinger W, Ullrich R (2014) From seven to eleven: completely positive matrices with high cp-rank. Linear Algebra Appl 459:208–221

    Article  Google Scholar 

  • Brouwer AE, Haemers WH (2012) Spectra of graphs. Springer, New York

    Book  Google Scholar 

  • Burer S (2009) On the copositive representation of binary and continuous nonconvex quadratic programs. Math Program 120:479–495

    Article  Google Scholar 

  • Dahl G, Haufmann TA (2016) Zero-one completely positive matrices and the \({\cal{A}}(R, S)\) classes. Spec Matrices 4:296–304

    Google Scholar 

  • Drew JH, Johnson CR, Loewy R (1994) Completely positive matrices associated with \(M\)-matrices. Linear Multilinear Algebra 37(4):303–310

    Article  Google Scholar 

  • Dür M (2010) Copositive programming—a survey. In: Diehl M, Glineur F, Jarlebring E, Michiels W (eds) Recent advances in optimization and its applications in Engineering. Springer-Verlag, Berlin, pp 3–20

    Chapter  Google Scholar 

  • Dutour Sikirić M, Schürmann A, Vallentin F (2017) Rational factorizations of completely positive matrices. Linear Algebra Appl 523:46–51

    Article  Google Scholar 

  • Hoffman AJ, Pereira F (1973) On copositive matrices with \(-1\),\(0\),\(1\) entries. J Comb Theory. Series A 14:302–309

    Article  Google Scholar 

  • Kogan N, Berman A (1993) Characterization of completely positive graphs. Discret Math 114(1–3):297–304

    Article  Google Scholar 

  • Laffey T, Šmigoc H (2018) Integer completely positive matrices of order 2. Pure Appl Funct Anal 3(4):633–638

    Google Scholar 

  • Maxfield JE, Minc H (1962/1963) On the matrix equation \(X^{\prime } X=A\). Proc Edinburgh Math Soc 13, 125–129

  • Shaked-Monderer N (2021) On the number of CP factorizations of a completely positive matrix. Linear Multilinear Algebra. https://doi.org/10.1080/03081087.2020.1856766

    Article  Google Scholar 

  • Shaked-Monderer N, Berman A (2021) Copositive and completely positive matrices. World Scientific Publishing Co. Pte. Ltd., Hackensack

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technion – Israel Institute of Technology, Haifa, 3200003, Israel

    Abraham Berman

  2. The Max Stern Yezreel Valley College, Yezreel Valley, 1930600, Israel

    Naomi Shaked-Monderer

Authors
  1. Abraham Berman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Naomi Shaked-Monderer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Naomi Shaked-Monderer.

Additional information

Dedicated to Prof. Sanjo Zlobec on the occasion of his 80th birthday.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Berman, A., Shaked-Monderer, N. Triangle-free graphs and completely positive matrices. Cent Eur J Oper Res 30, 1093–1099 (2022). https://doi.org/10.1007/s10100-021-00750-9

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-021-00750-9

Keywords

Mathematics Subject Classification

Search

Navigation