An iterative algorithm for third-order tensor multi-rank minimization
From MaRDI portal
Publication:5963314
DOI10.1007/S10589-015-9769-XzbMATH Open1356.90143OpenAlexW2188284642MaRDI QIDQ5963314FDOQ5963314
Zhenghai Huang, Shenglong Hu, Jiye Han, Lei Yang
Publication date: 7 March 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9769-x
Recommendations
- Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
- Factorization strategies for third-order tensors
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
- Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
- Triple decomposition and tensor recovery of third order tensors
Cites Work
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Title not available (Why is that?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- Tensor Decompositions and Applications
- Exact matrix completion via convex optimization
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Convex Analysis
- Characterization of the subdifferential of some matrix norms
- Factorization strategies for third-order tensors
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Title not available (Why is that?)
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Fixed point and Bregman iterative methods for matrix rank minimization
- Nonlinear Programming
- A Simpler Approach to Matrix Completion
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Tensor rank is NP-complete
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- Third-order tensors as linear operators on a space of matrices
- Facial recognition using tensor-tensor decompositions
Cited In (8)
- Continuity, differentiability and semismoothness of generalized tensor functions
- Minimum \( n\)-rank approximation via iterative hard thresholding
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
- Generalized tensor function via the tensor singular value decomposition based on the T-product
- A fast alternating least squares method for third-order tensors based on a compression procedure
- T-product factorization method for internet traffic data completion with spatio-temporal regularization
- An orthogonal equivalence theorem for third order tensors
- T-product factorization based method for matrix and tensor completion problems
Uses Software
This page was built for publication: An iterative algorithm for third-order tensor multi-rank minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963314)
