The nonconvex tensor robust principal component analysis approximation model via the weighted _p-norm regularization
DOI10.1007/S10915-021-01679-6zbMATH Open1484.62074OpenAlexW3213372190MaRDI QIDQ2053328FDOQ2053328
Authors: Wen Li, Yannan Chen, Mingqing Xiao, Ming-Hui Li 
Publication date: 29 November 2021
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-021-01679-6
Recommendations
- [[:Publication:6173530|Tensor Robust Principal Component Analysis via Tensor Fibered Rank and \({\boldsymbolTemplate:L p}\) Minimization]]
- Robust PCA using nonconvex rank approximation and sparse regularizer
- A novel robust principal component analysis algorithm of nonconvex rank approximation
- Robust tensor recovery with nonconvex and nonsmooth regularization
- Nonconvex Regularized Robust PCA Using the Proximal Block Coordinate Descent Algorithm
- Robust PCA via <inline-formula> <tex-math notation="LaTeX">$\ell _{0}$</tex-math> </inline-formula>-<inline-formula> <tex-math notation="LaTeX">$\ell _{1}$<
- Robust sparse \(L_p\)-norm principal component analysis
- Tensor principal component analysis via convex optimization
- Nonlocal robust tensor recovery with nonconvex regularization
- A generalized non-convex method for robust tensor completion
low rank approximationalternating direction method of multipliersnon-convex optimization\(\ell_p\)-normtensor singular value decompositiontensor robust principal component analysis
Factor analysis and principal components; correspondence analysis (62H25) Numerical mathematical programming methods (65K05) Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Robust principal component analysis?
- Tensor Decompositions and Applications
- Linear and nonlinear programming.
- Tensor-train decomposition
- A Multilinear Singular Value Decomposition
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Factorization strategies for third-order tensors
- De-noising by soft-thresholding
- Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- L 1/2 regularization
- Nonsmooth analysis of singular values. I: Theory
- Tensor analysis. Spectral theory and special tensors
- Compressive Sensing via Nonlocal Low-Rank Regularization
- Weighted nuclear norm minimization and its applications to low level vision
- Exact Tensor Completion Using t-SVD
- Mathematics for Machine Learning
- Low-rank tensor train for tensor robust principal component analysis
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- Nonconvex tensor rank minimization and its applications to tensor recovery
- A non-convex tensor rank approximation for tensor completion
- Multi-dimensional imaging data recovery via minimizing the partial sum of tubal nuclear norm
- Nonconvex optimization for robust tensor completion from grossly sparse observations
- Robust tensor completion using transformed tensor singular value decomposition
- Robust Low-Rank Tensor Minimization via a New Tensor Spectral $k$ -Support Norm
- Multiview clustering of images with tensor rank minimization via nonconvex approach
Cited In (14)
- Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
- The accelerated tensor Kaczmarz algorithm with adaptive parameters for solving tensor systems
- Augmented Lagrangian alternating direction method for tensor RPCA
- A novel robust principal component analysis algorithm of nonconvex rank approximation
- Nonconvex multi-view subspace clustering via simultaneously learning the representation tensor and affinity matrix*
- TIHN: tensor improved huber norm for low-rank tensor recovery
- Rank-min-one and sparse tensor decomposition for surveillance video
- Low-rank tensor train for tensor robust principal component analysis
- The generalized tensor decomposition with heterogeneous tensor product for third-order tensors
- A generalized non-convex method for robust tensor completion
- Nonconvex tensor rank minimization and its applications to tensor recovery
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- Nonlocal robust tensor recovery with nonconvex regularization
- T-product based \(\ell_1\)-norm tensor principal component analysis and a finite-step convergence algorithm
Uses Software
This page was built for publication: The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053328)
