The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion (Q1740089)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion |
scientific article; zbMATH DE number 7048864
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion |
scientific article; zbMATH DE number 7048864 |
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
0.7922487854957581
0 references
0.7898671627044678
0 references
0.7886909246444702
0 references
0.7842286825180054
0 references
