Construct · 1 fields · 1 citations

low-rank matrix completion: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Signal processing

the exact recovery of a low-rank matrix from a small random subset of its entries by nuclear norm minimization.

In signal processing, low-rank matrix completion refers to the exact recovery of a low-rank matrix from a small random subset of its entries by nuclear norm minimization. This meaning comes from Candès (2009) in Foundations of Computational Mathematics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how low-rank matrix completion sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

matrix3 fields · 4 citationsjingle · one word, three constructs minimization1 fields · 1 citationsanchor · a standalone construct norm4 fields · 4 citationsjingle · one word, four constructs

References

Candès, E. J., & Recht, B. (2009). Exact Matrix Completion via Convex Optimization. Foundations of Computational Mathematics, 9(6), 717-772. https://doi.org/10.1007/s10208-009-9045-5

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct