arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.6970math.OC
收藏

基于非负核范数的非负秩的下界

Lower bounds on nonnegative rank via nonnegative nuclear norms

Hamza Fawzi, Pablo A. Parrilo

摘要:

大小为mxn的逐项非负矩阵A的非负秩是最小整数r,使得A可以写为A=UV,其中U是mxr,V是rxn,U和V都是非负的。非负秩出现在不同的领域,如组合优化和通信复杂性。计算这个量通常是NP困难的,因此找到有效的边界技术是很重要的,特别是在上述应用的上下文中。在本文中,我们提出了一个新的下界的非负秩,不同于大多数现有的下界,不显式依赖于矩阵稀疏模式,并适用于非负矩阵的任意支持。该思想涉及到计算一个特定的核范数与非负约束,允许下界的非负秩,以同样的方式,标准的核范数给出标准秩的下界。我们的下界表示为一个共同的规划问题的解决方案,并可以放宽到获得多项式时间可计算的下界使用半定规划。我们比较我们的下界与现有的,我们显示的例子矩阵,我们的下界比目前已知的表现更好。

英文摘要:

The nonnegative rank of an entrywise nonnegative matrix A of size mxn is the smallest integer r such that A can be written as A=UV where U is mxr and V is rxn and U and V are both nonnegative. The nonnegative rank arises in different areas such as combinatorial optimization and communication complexity. Computing this quantity is NP-hard in general and it is thus important to find efficient bounding techniques especially in the context of the aforementioned applications. In this paper we propose a new lower bound on the nonnegative rank which, unlike most existing lower bounds, does not explicitly rely on the matrix sparsity pattern and applies to nonnegative matrices with arbitrary support. The idea involves computing a certain nuclear norm with nonnegativity constraints which allows to lower bound the nonnegative rank, in the same way the standard nuclear norm gives lower bounds on the standard rank. Our lower bound is expressed as the solution of a copositive programming problem and can be relaxed to obtain polynomial-time computable lower bounds using semidefinite programming. We compare our lower bound with existing ones, and we show examples of matrices where our lower bound performs better than currently known ones.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑