HAL (France)
open access
Structured Nuclear Norm Matrix Completion: Guaranteeing Exact Recovery via Block‐Column Scaling
The goal of low‐rank matrix completion is to minimize the rank of a matrix while adhering to the constraint that known (non‐missing) elements are fixed in the approximation. Minimizing rank is a difficult, non‐convex, NP‐hard problem, often addressed by substituting rank with the nuclear norm to ach
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
- Memory-Time Trade-offs for Floating-Point Compression in Industrial Hierarchical Matrix Solvers#291691
- Simultaneous Matrix-Free HSS Compression and Factorization with Adaptive Ranks#1341795
- Factorization of matrices by least-squares#1305740
- Exact Nonnegative Matrix Factorization via Cone-Ray Witnesses: Certificates, a One-Sided Solver, and a Findability Phase Transition#652362
- Exact Nonnegative Matrix Factorization via Cone-Ray Witnesses: Certificates, a One-Sided Solver, and a Findability Phase Transition#650909
Record · ID 1358517
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