Mathematics – Optimization and Control
Scientific paper
2010-09-04
Mathematics
Optimization and Control
Scientific paper
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors needed to reconstruct it exactly. The problem of determining this rank and computing the corresponding nonnegative factors is difficult; however it has many potential applications, e.g., in data mining, graph theory and computational geometry. In particular, it can be used to characterize the minimal size of any extended reformulation of a given combinatorial optimization program. In this paper, we introduce and study a related quantity, called the restricted nonnegative rank. We show that computing this quantity is equivalent to a problem in polyhedral combinatorics, and fully characterize its computational complexity. This in turn sheds new light on the nonnegative rank problem, and in particular allows us to provide new improved lower bounds based on its geometric interpretation. We apply these results to slack matrices and linear Euclidean distance matrices and obtain counter-examples to two conjectures of Beasly and Laffey, namely we show that the nonnegative rank of linear Euclidean distance matrices is not necessarily equal to their dimension, and that the rank of a matrix is not always greater than the nonnegative rank of its square.
Gillis Nicolas
Glineur François
No associations
LandOfFree
On the Geometric Interpretation of the Nonnegative Rank does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Geometric Interpretation of the Nonnegative Rank, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Geometric Interpretation of the Nonnegative Rank will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-473516