A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion (Q2873262)
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 block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion |
scientific article; zbMATH DE number 6249711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion |
scientific article; zbMATH DE number 6249711 |
Statements
23 January 2014
0 references
block multiconvex
0 references
block coordinate descent
0 references
Kurdyka-Łojasiewicz inequality
0 references
Nash equilibrium
0 references
nonnegative matrix/tensor factorization
0 references
matrix completion
0 references
tensor completion
0 references
proximal gradient method
0 references
A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion (English)
0 references
0.8101940751075745
0 references
0.8010900616645813
0 references
0.7904447317123413
0 references
0.7892875671386719
0 references
0.7867163419723511
0 references
