Minimum \( n\)-rank approximation via iterative hard thresholding (Q299732)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum n-rank approximation via iterative hard thresholding |
scientific article; zbMATH DE number 6596861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum \( n\)-rank approximation via iterative hard thresholding |
scientific article; zbMATH DE number 6596861 |
Statements
Minimum \( n\)-rank approximation via iterative hard thresholding (English)
0 references
22 June 2016
0 references
iterative hard thresholding
0 references
low-\( n\)-rank tensor recovery
0 references
tensor completion
0 references
compressed sensing
0 references
0 references
0 references
0 references
0 references
0 references
0.8464999198913574
0 references
0.8357705473899841
0 references
0.8349104523658752
0 references
0.8250940442085266
0 references
0.8104500770568848
0 references
