A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm (Q643650)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5966346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm |
scientific article; zbMATH DE number 5966346 |
Statements
A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm (English)
0 references
2 November 2011
0 references
convex optimization
0 references
exact matrix completion
0 references
nuclear norm
0 references
SVT algorithm
0 references
0.95716125
0 references
0.9489906
0 references
0.9176556
0 references
0.9154273
0 references
0.89769864
0 references
0.89292514
0 references
0.88915026
0 references
0.8808457
0 references
0.8765989
0 references
0.87596554
0 references
