Optimization on the Hierarchical Tucker manifold – Applications to tensor completion
- 1 September 2015
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 481, 131-173
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Natural Sciences and Engineering Research Council of Canada
- Natural Sciences and Engineering Research Council of Canada
This publication has 34 references indexed in Scilit:
- Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed SensingIEEE Transactions on Signal Processing, 2014
- Black box approximation of tensors in hierarchical Tucker formatLinear Algebra and its Applications, 2013
- A scalable optimization approach for fitting canonical tensor decompositionsJournal of Chemometrics, 2011
- The Power of Convex Relaxation: Near-Optimal Matrix CompletionIEEE Transactions on Information Theory, 2010
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a TensorSIAM Journal on Matrix Analysis and Applications, 2009
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation ProblemSIAM Journal on Matrix Analysis and Applications, 2008
- A Multilinear Singular Value DecompositionSIAM Journal on Matrix Analysis and Applications, 2000
- Analysis of Individual Differences in Multidimensional Scaling Via an N-way Generalization of “Eckart-Young” DecompositionPsychometrika, 1970