An iterative algorithm for third-order tensor multi-rank minimization
From MaRDI portal
Publication:5963314
DOI10.1007/s10589-015-9769-xzbMath1356.90143OpenAlexW2188284642MaRDI QIDQ5963314
Zheng-Hai Huang, Sheng-Long Hu, Ji-ye 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
Related Items (7)
Minimum \( n\)-rank approximation via iterative hard thresholding ⋮ An orthogonal equivalence theorem for third order tensors ⋮ Generalized tensor function via the tensor singular value decomposition based on the T-product ⋮ Continuity, differentiability and semismoothness of generalized tensor functions ⋮ T-product factorization based method for matrix and tensor completion problems ⋮ T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming ⋮ T-product factorization method for internet traffic data completion with spatio-temporal regularization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Factorization strategies for third-order tensors
- Fixed point and Bregman iterative methods for matrix rank minimization
- Characterization of the subdifferential of some matrix norms
- Exact matrix completion via convex optimization
- Facial Recognition Using Tensor-Tensor Decompositions
- A Singular Value Thresholding Algorithm for Matrix Completion
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Tensor rank is NP-complete
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- A Simpler Approach to Matrix Completion
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Nonlinear Programming
- Convex Analysis
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Third-order tensors as linear operators on a space of matrices
This page was built for publication: An iterative algorithm for third-order tensor multi-rank minimization