Lund University Publications
metadata only
Convex Envelopes for Low Rank Approximation
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
- Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers#1156354
- Metric-agnostic Learning-to-Rank via Boosting and Rank Approximation#19020
- Monotone Classification with Relative Approximations#629785
- Monotone Classification with Relative Approximations#627923
- Sparse Convexification for High-Dimensional Constrained Regression#618101
Record · ID 319027
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