A generalized non-convex method for robust tensor completion

Cites Work

Nearly unbiased variable selection under minimax concave penalty
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Convex analysis approach to d. c. programming: Theory, algorithms and applications
Robust principal component analysis?
Factorization strategies for third-order tensors
Robust matrix completion
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
Robust low-rank tensor recovery: models and algorithms
Point source super-resolution via non-convex $L_1$ based methods
Robust Matrix Completion via Maximum Correntropy Criterion and Half-Quadratic Optimization
An Order-$p$ Tensor Factorization with Applications in Imaging
Tensor-tensor products with invertible linear transforms
Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery
Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
Smooth PARAFAC Decomposition for Tensor Completion
Generalized Assorted Pixel Camera: Postcapture Control of Resolution, Dynamic Range, and Spectrum
The nonconvex tensor robust principal component analysis approximation model via the weighted $\ell_p$-norm regularization
Framelet Representation of Tensor Nuclear Norm for Third-Order Tensor Completion
Iterative $p$-shrinkage thresholding algorithm for low Tucker rank tensor recovery
Robust Low-Rank Tensor Recovery via Nonconvex Singular Value Minimization
Nonconvex optimization for robust tensor completion from grossly sparse observations
Robust tensor completion using transformed tensor singular value decomposition
Color image and video restoration using tensor CP decomposition
A new tensor multi-rank approximation with total variation regularization for tensor completion
Robust Schatten-$p$ norm based approach for tensor completion
Low-rank tensor completion based on log-det rank approximation and matrix factorization
Outlier-Robust Matrix Completion via $\ell _p$ -Minimization
A Novel Regularized Model for Third-Order Tensor Completion

Cited In (4)

The nonconvex tensor robust principal component analysis approximation model via the weighted $\ell_p$-norm regularization
A non-convex tensor rank approximation for tensor completion
Nonconvex optimization for robust tensor completion from grossly sparse observations
An Adaptive Correction Approach for Tensor Completion

This page was built for publication: A generalized non-convex method for robust tensor completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134430)