Nonconvex tensor rank minimization and its applications to tensor recovery
From MaRDI portal
Publication:2224917
Recommendations
- The nonconvex tensor robust principal component analysis approximation model via the weighted _p-norm regularization
- A non-convex tensor rank approximation for tensor completion
- Nonlocal robust tensor recovery with nonconvex regularization
- Tensor \(N\)-tubal rank and its convex relaxation for low-rank tensor recovery
- Proximal gradient algorithm for nonconvex low tubal rank tensor recovery
Cites work
- A Multilinear Singular Value Decomposition
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Exact Tensor Completion Using t-SVD
- Factorization strategies for third-order tensors
- Joint variable and rank selection for parsimonious estimation of high-dimensional matrices
- On tensor completion via nuclear norm minimization
- Parallel matrix factorization for low-rank tensor completion
- Robust low-rank tensor recovery: models and algorithms
- Robust Multilinear Tensor Rank Estimation Using Higher Order Singular Value Decomposition and Information Criteria
- Robust principal component analysis?
- Smooth PARAFAC Decomposition for Tensor Completion
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor Decompositions and Applications
- Tensor Discriminant Color Space for Face Recognition
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- Total Variation Regularized Tensor RPCA for Background Subtraction From Compressive Measurements
- Tucker factorization with missing data with application to low-n-rank tensor completion
- Von Neumann's trace inequality for tensors
Cited in
(23)- Recovery algorithms for high-dimensional rank one tensors
- Tensor \(N\)-tubal rank and its convex relaxation for low-rank tensor recovery
- Tensor theta norms and low rank recovery
- The nonconvex tensor robust principal component analysis approximation model via the weighted _p-norm regularization
- Nonconvex optimization for robust tensor completion from grossly sparse observations
- A non-convex tensor rank approximation for tensor completion
- Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
- Nonnegative low rank tensor approximations with multidimensional image applications
- Minimax Lower Bounds on Dictionary Learning for Tensor Data
- Robust Low-Rank Tensor Minimization via a New Tensor Spectral $k$ -Support Norm
- Robust Low-Rank Tensor Recovery via Nonconvex Singular Value Minimization
- Multiview clustering of images with tensor rank minimization via nonconvex approach
- Low-rank tensor data reconstruction and denoising via ADMM: algorithm and convergence analysis
- Iterative tensor eigen rank minimization for low-rank tensor completion
- Tensor completion via multi-directional partial tensor nuclear norm with total variation regularization
- HTR-CTO algorithm for wireless data recovery
- Mixed norm regularized models for low-rank tensor completion
- TIHN: tensor improved huber norm for low-rank tensor recovery
- Nonlinear hierarchical matrix factorization-based tensor ring approximation for multi-dimensional image recovery
- Tensor robust principal component analysis via non-convex low-rank approximation based on the Laplace function
- A novel nonconvex rank approximation with application to the matrix completion
- A robust tensor wheel decomposition-based regularization method for tensor completion problem
- Rank related properties for basis pursuit and total variation regularization
This page was built for publication: Nonconvex tensor rank minimization and its applications to tensor recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224917)
