The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion (Q1740089): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2017.07.024 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2017.07.024 / rank | |||
Normal rank | |||
Latest revision as of 07:14, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion |
scientific article |
Statements
The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion (English)
0 references
29 April 2019
0 references
two-stage iteration
0 references
alternating steepest descent algorithm
0 references
low-rank matrix completion
0 references
distance
0 references
0 references
0 references
