Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT)
DOI10.1137/16M1062089zbMath1365.15035OpenAlexW2611420007MaRDI QIDQ5738180
Gérard Favier, José Henrique de Morais Goulart
Publication date: 31 May 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1062089
algorithmnumerical experimentiterative hard thresholdingtensor completionlow-rank tensor recoverymultilinear rankhyperspectral image reconstructionsequentially optimal modal projections
Approximation methods and heuristics in mathematical programming (90C59) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Multilinear algebra, tensor calculus (15A69)
Uses Software
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- Parallel matrix factorization for low-rank tensor completion
- Minimum \( n\)-rank approximation via iterative hard thresholding
- A mathematical introduction to compressive sensing
- Low-rank tensor completion by Riemannian optimization
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Iterative thresholding for sparse approximations
- Generic and typical ranks of multi-way arrays
- The convex geometry of linear inverse problems
- Tensor theta norms and low rank recovery
- Matrix recipes for hard thresholding methods
- Optimization on the hierarchical Tucker manifold - applications to tensor completion
- Low rank tensor recovery via iterative hard thresholding
- Exact matrix completion via convex optimization
- A literature survey of low-rank tensor approximation techniques
- Normalized Iterative Hard Thresholding for Matrix Completion
- Proximal Splitting Methods in Signal Processing
- A New Truncation Strategy for the Higher-Order Singular Value Decomposition
- Hierarchical Singular Value Decomposition of Tensors
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Variants of Alternating Least Squares Tensor Completion in the Tensor Train Format
- Tensor Completion in Hierarchical Tensor Representations
- On sparse reconstruction from Fourier and Gaussian measurements
- Decoding by Linear Programming
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A Multilinear Singular Value Decomposition
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Most Tensor Problems Are NP-Hard
This page was built for publication: Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT)
