SIAM Journal on Optimization· 2013Q1
Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
- 279citations
- Q1SCImago
- 2013year
Short summary
New optimization-based algorithms efficiently compute a generalized tensor decomposition that unifies Canonical Polyadic Decomposition (CPD) and rank-(Lr,Lr,1) Block Term Decomposition (BTD).
AI-generated from the title and abstract; the full text is not read.
TakeawaysIn the app
Key pointsIn the app
Ask the paperIn the app
The rest is in the Pofolia app
Takeaways, key points and questions to the paper; new summaries every day for your field. Free.
Sign in on the web to openField: Computational Mathematics
Computational MathematicsMathematics