Non-convex solvers compute improved lower bounds on nonnegative matrix rank, with a new algorithm for the self-scaled bound that establishes exact rank for some matrices.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
Non-convex solvers compute improved lower bounds on nonnegative matrix rank, with a new algorithm for the self-scaled bound that establishes exact rank for some matrices.