A rank-corrected procedure for matrix completion with fixed basis coefficients (Q312678): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (6 intermediate revisions by 6 users not shown) | |||
| Property / author | |||
| Property / author: Defeng Sun / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962771824 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1210.3709 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:30, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A rank-corrected procedure for matrix completion with fixed basis coefficients |
scientific article |
Statements
A rank-corrected procedure for matrix completion with fixed basis coefficients (English)
0 references
16 September 2016
0 references
The authors consider the matrix completion problem as well as an adaptive nuclear semi-norm technique for its solution. In particular, they propose a rank-corrected procedure which uses a nuclear semi-norm for generating a new estimator. Here, they quantify the reduction of the recovery error bound. Finally, several numerical experiments illustrate the presented results.
0 references
matrix completion
0 references
fixed basis coefficients
0 references
low-rank
0 references
convex optimization
0 references
rank consistency
0 references
constraint nondegeneracy
0 references
