Perturbation Theory and Optimality Conditions for the Best Multilinear Rank Approximation of a Tensor.
Lars EldénBerkant SavasPublished in: SIAM J. Matrix Anal. Appl. (2011)
Keyphrases
- optimality conditions
- perturbation theory
- order tensor
- higher order
- high order
- nonlinear programming
- tensor decomposition
- higher order tensors
- semi infinite programming
- lower level
- dimensionality reduction
- sample size
- approximation algorithms
- higher order singular value decomposition
- linear programming
- maximal cliques
- higher level
- special case
- machine learning
- traveling salesman problem
- stationary points
- game theory
- pairwise