arXiv (All)
open access
Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
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 common to circumvent this issue by computing lower and upper bounds. In this paper, we propose non-convex formulations and p
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
- Low-rank matrix recovery landscapes beyond RIP with application to rank-one measurements#973750
- Near-Optimal Nonconvex Matrix Completion#1123449
- Near-Optimal Nonconvex Matrix Completion#919410
- Convex Envelopes for Low Rank Approximation#319027
Record · ID 1156354
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive