A generalized non-convex method for robust tensor completion
From MaRDI portal
Publication:6134430
DOI10.1007/s10915-023-02308-0MaRDI QIDQ6134430
Zhechen Zhang, San-Yang Liu, Zhiping Lin
Publication date: 22 August 2023
Published in: Journal of Scientific Computing (Search for Journal in Brave)
difference of convex functionsnon-convexrobust tensor completiontransformed tensor nuclear normlow-tubal-rank
Cites Work
- Nearly unbiased variable selection under minimax concave penalty
- Point source super-resolution via non-convex \(L_1\) based methods
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Factorization strategies for third-order tensors
- Robust matrix completion
- Tensor-tensor products with invertible linear transforms
- Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization
- Color image and video restoration using tensor CP decomposition
- A new tensor multi-rank approximation with total variation regularization for tensor completion
- Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery
- Nonconvex optimization for robust tensor completion from grossly sparse observations
- Robust Schatten-\(p\) norm based approach for tensor completion
- Low-rank tensor completion based on log-det rank approximation and matrix factorization
- Robust Low-Rank Tensor Recovery: Models and Algorithms
- Robust principal component analysis?
- Robust tensor completion using transformed tensor singular value decomposition
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- Smooth PARAFAC Decomposition for Tensor Completion
- Outlier-Robust Matrix Completion via $\ell _p$ -Minimization
- An Order-$p$ Tensor Factorization with Applications in Imaging
- Robust Matrix Completion via Maximum Correntropy Criterion and Half-Quadratic Optimization
- A Novel Regularized Model for Third-Order Tensor Completion
- Framelet Representation of Tensor Nuclear Norm for Third-Order Tensor Completion
- Robust Low-Rank Tensor Recovery via Nonconvex Singular Value Minimization
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Generalized Assorted Pixel Camera: Postcapture Control of Resolution, Dynamic Range, and Spectrum
This page was built for publication: A generalized non-convex method for robust tensor completion