The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion (Q1740089): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: RTRMC / rank | |||
Normal rank | |||
Revision as of 01:59, 29 February 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
