A nonconvex approach to low-rank matrix completion using convex optimization (Q2955982): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPT3 / rank | |||
Normal rank | |||
Revision as of 08:17, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A nonconvex approach to low-rank matrix completion using convex optimization |
scientific article |
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
