Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers

Timothy Baeckelant, Arnaud Vandaele, Nicolas Gillis

The nonnegative rank of a nonnegative matrix $X$ is the smallest number of nonnegative rank-one factors that sum to $X$. Since computing the nonnegative rank is NP-hard, it is comm…