Skip to content
BY-NC-ND 3.0 license Open Access Published by De Gruyter Open Access July 18, 2016

Zero-one completely positive matrices and the A(R, S) classes

  • G. Dahl and T. A. Haufmann
From the journal Special Matrices

Abstract

A matrix of the form A = BBT where B is nonnegative is called completely positive (CP). Berman and Xu (2005) investigated a subclass of CP-matrices, called f0, 1g-completely positive matrices. We introduce a related concept and show connections between the two notions. An important relation to the so-called cut cone is established. Some results are shown for f0, 1g-completely positive matrices with given graphs, and for {0,1}-completely positive matrices constructed from the classes of (0, 1)-matrices with fixed row and column sums.

References

[1] A. Berman and N. Shaked-Monderer. Completely Positive Matrices. World Scientific Publishing Co. Pte Ltd., Singapore, 2003. 10.1142/5273Search in Google Scholar

[2] A. Berman and C. Xu. {0,1} Completely positive matrices. Linear Algebra Appl., 399:35–51, Apr 2005. 10.1016/j.laa.2004.04.026Search in Google Scholar

[3] A. Berman and C. Xu. Uniform and minimal {0,1}-cp matrices. Linear and Multilinear Algebra, 55(5):439–456, Sep 2007. 10.1080/03081080500473044Search in Google Scholar

[4] R. A. Brualdi. Combinatorial Matrix Classes, volume 13. Cambridge University Press, Cambridge, 2006. 10.1017/CBO9780511721182Search in Google Scholar

[5] S. Bundfuss and M. Dür. An adaptive linear approximation algorithm for copositive programs. SIAM J. Optim., 20(1):30–53, 2008. 10.1137/070711815Search in Google Scholar

[6] S. Burer. On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program., 120(2):479–495, Apr 2008. 10.1007/s10107-008-0223-zSearch in Google Scholar

[7] G. Dahl. A note on diagonally dominant matrices. Linear Algebra Appl., 317(1-3):217–224, Sep 2000. 10.1016/S0024-3795(00)00178-6Search in Google Scholar

[8] M. Deza and M. Laurent. Geometry of Cuts and Metrics. Springer, 1997. 10.1007/978-3-642-04295-9Search in Google Scholar

[9] M. Dür. Copositive Programming - A Survey. In Moritz Diehl, Francois Glineur, Elias Jarlebring, and Wim Michiels, editors, Recent Advances in Optimization and its Applications in Engineering, number 1, pages 3–21. Springer Berlin Heidelberg, Berlin, Heidelberg, 2010. Search in Google Scholar

[10] A. V. Karzanov. Metrics and undirected cuts. Math. Program., 32(2):183–198, 1985. 10.1007/BF01586090Search in Google Scholar

[11] F. Laburthe, M. Deza, and M. Laurent. The Hilbert basis of the cut cone over the complete graph on six vertices. Technical report, 1995. 10.1007/3-540-59408-6_56Search in Google Scholar

[12] OEIS Foundation Inc. The On-Line Encyclopedia of Integer Sequences, https://oeis.org, 2016. Search in Google Scholar

[13] J. Zhong. Binary ranks and binary factorizations of nonnegative integermatrices. Electronic J. Linear Algebra, 23(June):540– 552, 2012. 10.13001/1081-3810.1539Search in Google Scholar

Received: 2016-4-6
Accepted: 2016-5-23
Published Online: 2016-7-18

©2016 G. Dahl and T. A. Haufmann

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Downloaded on 23.2.2024 from https://www.degruyter.com/document/doi/10.1515/spma-2016-0024/html
Scroll to top button