Robust tensor recovery with nonconvex and nonsmooth regularization
From MaRDI portal
(Redirected from Publication:2096313)
Recommendations
- Nonlocal robust tensor recovery with nonconvex regularization
- Nonconvex optimization for robust tensor completion from grossly sparse observations
- Robust low-rank tensor recovery: models and algorithms
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Proximal gradient algorithm for nonconvex low tubal rank tensor recovery
Cites work
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Exact Tensor Completion Using t-SVD
- Low rank Tucker-type tensor approximation to classical potentials
- Low-Tubal-Rank Tensor Completion Using Alternating Minimization
- Low-rank tensor completion using matrix factorization based on tensor train rank and total variation
- Nonlocal robust tensor recovery with nonconvex regularization
- Robust principal component analysis?
- Tensor Decompositions and Applications
- Tensor rank is NP-complete
- Tensor-train decomposition
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
- Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss
Cited in
(6)- Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation
- Robust Low-Rank Tensor Recovery via Nonconvex Singular Value Minimization
- The nonconvex tensor robust principal component analysis approximation model via the weighted _p-norm regularization
- Robust Low-Rank Tensor Minimization via a New Tensor Spectral $k$ -Support Norm
- Nonlocal robust tensor recovery with nonconvex regularization
- Nonconvex optimization for robust tensor completion from grossly sparse observations
This page was built for publication: Robust tensor recovery with nonconvex and nonsmooth regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096313)
