A new complexity metric for nonconvex rank-one generalized matrix completion (Q6608034)
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: A new complexity metric for nonconvex rank-one generalized matrix completion |
scientific article; zbMATH DE number 7915915
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new complexity metric for nonconvex rank-one generalized matrix completion |
scientific article; zbMATH DE number 7915915 |
Statements
A new complexity metric for nonconvex rank-one generalized matrix completion (English)
0 references
19 September 2024
0 references
matrix completion
0 references
complexity metric
0 references
nonconvex optimization
0 references
global convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
