The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion (Q1740089): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:44, 1 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
