Communications of the ACM· 2012Q1
Exact matrix completion via convex optimization
- 1,010citations
- Q1SCImago
- 2012year
Short summary
A convex optimization approach can perfectly recover missing entries of a low-rank matrix from a sufficiently large, randomly sampled subset of its entries.
AI-generated from the title and abstract; the full text is not read.
TakeawaysIn the app
Key pointsIn the app
Ask the paperIn the app
The rest is in the Pofolia app
Takeaways, key points and questions to the paper; new summaries every day for your field. Free.
Sign in on the web to openField: Computational Mechanics
Computational MechanicsEngineering