Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization (Q2848170)
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: Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(L_r,L_r,1) terms, and a new generalization |
scientific article; zbMATH DE number 6211558
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization |
scientific article; zbMATH DE number 6211558 |
Statements
25 September 2013
0 references
multilinear algebra
0 references
tensor decompositions
0 references
canonical polyadic decomposition
0 references
block term decomposition
0 references
optimization
0 references
algorithms
0 references
Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization (English)
0 references
0.836573600769043
0 references
0.8269144296646118
0 references
0.8215144872665405
0 references
0.8080072999000549
0 references
