Minimum \( n\)-rank approximation via iterative hard thresholding (Q299732): Difference between revisions
From MaRDI portal
Latest revision as of 04:51, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimum \( n\)-rank approximation via iterative hard thresholding |
scientific article |
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