An iterative algorithm for third-order tensor multi-rank minimization
From MaRDI portal
(Redirected from Publication:5963314)
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
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- A simpler approach to matrix completion
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Characterization of the subdifferential of some matrix norms
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convex Analysis
- Exact matrix completion via convex optimization
- Facial recognition using tensor-tensor decompositions
- Factorization strategies for third-order tensors
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fixed point and Bregman iterative methods for matrix rank minimization
- Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Nonlinear Programming
- Tensor Decompositions and Applications
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- 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
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
Cited in
(11)- Minimum n-rank approximation via iterative hard thresholding
- Continuity, differentiability and semismoothness of generalized tensor functions
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
- 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
- Triple decomposition and tensor recovery of third order tensors
- 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
- Low-rank quaternion tensor completion for color video inpainting via a novel factorization strategy
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)
