4.2 Article

Rational and real positive semidefinite rank can be different

期刊

OPERATIONS RESEARCH LETTERS
卷 44, 期 1, 页码 59-60

出版社

ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2015.11.012

关键词

Matrix factorization; Positive semidefinite rank; Semidefinite programming

资金

  1. AFOSR [FA9550-11-1-0305]
  2. Centre for Mathematics at the University of Coimbra [UID/MAT/00324/2013]
  3. Fundacao para a Ciencia e a Tecnologia through the European program COMPETE/FEDER
  4. US NSF Graduate Research Fellowship [DGE-1256082]

向作者/读者索取更多资源

Given a p x q nonnegative matrix M, the psd rank of M is the smallest integer k such that there exist k x k real symmetric positive semidefinite matrices A(1), ... ,A(p) and B-1, ... ,B-q such that M-ij = < A(i) , B-j > for i = 1, ... ,p and j = 1, ... ,q. When the entries of M are rational it is natural to consider the rational restricted psd rank of M, where the factors A(i) and B-i are required to have rational entries. It is clear that the rational-restricted psd rank is always an upper bound to the usual psd rank. We show that this inequality may be strict by exhibiting a matrix with psd rank four whose rational-restricted psd rank is strictly greater than four. (C) 2015 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.2
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据