Minimum n-rank approximation via iterative hard thresholding
From MaRDI portal
(Redirected from Publication:299732)
Minimum \( n\)-rank approximation via iterative hard thresholding
Minimum \( n\)-rank approximation via iterative hard thresholding
Abstract: The problem of recovering a low -rank tensor is an extension of sparse recovery problem from the low dimensional space (matrix space) to the high dimensional space (tensor space) and has many applications in computer vision and graphics such as image inpainting and video inpainting. In this paper, we consider a new tensor recovery model, named as minimum -rank approximation (MnRA), and propose an appropriate iterative hard thresholding algorithm with giving the upper bound of the -rank in advance. The convergence analysis of the proposed algorithm is also presented. Particularly, we show that for the noiseless case, the linear convergence with rate can be obtained for the proposed algorithm under proper conditions. Additionally, combining an effective heuristic for determining -rank, we can also apply the proposed algorithm to solve MnRA when -rank is unknown in advance. Some preliminary numerical results on randomly generated and real low -rank tensor completion problems are reported, which show the efficiency of the proposed algorithms.
Recommendations
- Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery
- An inexact continuation accelerated proximal gradient algorithm for low \textit{n}-rank tensor recovery
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Low rank tensor recovery via iterative hard thresholding
- Iterative hard thresholding for low CP-rank tensor models
Cites work
- A Fixed Point Iterative Method for Low $n$-Rank Tensor Pursuit
- A reweighted nuclear norm minimization algorithm for low rank matrix recovery
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Algorithm 862
- An iterative algorithm for third-order tensor multi-rank minimization
- Conditions for the equivalence between the low-n-rank tensor recovery problem and its convex relaxation
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Convex multi-task feature learning
- Exact matrix completion via convex optimization
- 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
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Interior-point method for nuclear norm approximation with application to system identification
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Matrix Completion From a Few Entries
- Matrix recipes for hard thresholding methods
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Restricted p-Isometry Properties of Nonconvex Matrix Recovery
- Robust low-rank tensor recovery: models and algorithms
- Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor completion in hierarchical tensor representations
Cited in
(11)- An inexact continuation accelerated proximal gradient algorithm for low \textit{n}-rank tensor recovery
- Low-rank approximation of tensors via sparse optimization.
- Iterative singular tube hard thresholding algorithms for tensor recovery
- Iterative hard thresholding for low CP-rank tensor models
- Continuity, differentiability and semismoothness of generalized tensor functions
- Rank-min-one and sparse tensor decomposition for surveillance video
- Low rank tensor recovery via iterative hard thresholding
- Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery
- Null space conditions and thresholds for rank minimization
- N-Dimensional Tensor Completion for Nuclear Magnetic Resonance Relaxometry
- Low-rank tensor recovery using sequentially optimal modal projections in iterative hard thresholding (SeMPIHT)
This page was built for publication: Minimum \( n\)-rank approximation via iterative hard thresholding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299732)
