A nonconvex approach to low-rank matrix completion using convex optimization. (Q2955982)
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 6674921
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A nonconvex approach to low-rank matrix completion using convex optimization. |
scientific article; zbMATH DE number 6674921 |
Statements
A nonconvex approach to low-rank matrix completion using convex optimization (English)
0 references
13 January 2017
0 references
matrix completion
0 references
nonconvex minimization
0 references
forward-backward splitting
0 references
proximity operator
0 references
matrix setting
0 references
convex optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8552256226539612
0 references
0.850184440612793
0 references
0.8339893817901611
0 references
0.8264573216438293
0 references
