A Simpler Approach to Matrix Completion (Q5396731): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by the same user not shown) | |||
| label / en | label / en | ||
A Simpler Approach to Matrix Completion | |||
| Property / arXiv classification | |||
cs.IT | |||
| Property / arXiv classification: cs.IT / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
cs.NA | |||
| Property / arXiv classification: cs.NA / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
math.IT | |||
| Property / arXiv classification: math.IT / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
math.OC | |||
| Property / arXiv classification: math.OC / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0910.0651 / rank | |||
Normal rank | |||
Latest revision as of 01:48, 20 April 2024
scientific article; zbMATH DE number 6253977
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Simpler Approach to Matrix Completion |
scientific article; zbMATH DE number 6253977 |
Statements
3 February 2014
0 references
matrix completion
0 references
low-rank matrices
0 references
convex optimization
0 references
nuclear norm minimization
0 references
random matrices
0 references
operator Chernoff bound
0 references
compressed sensing
0 references
cs.IT
0 references
cs.NA
0 references
math.IT
0 references
math.OC
0 references
