Robust tensor recovery with nonconvex and nonsmooth regularization
From MaRDI portal
Publication:2096313
DOI10.1016/J.AMC.2022.127566OpenAlexW4298113505MaRDI QIDQ2096313FDOQ2096313
Authors: Yanyan Li 
Publication date: 16 November 2022
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2022.127566
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
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Robust principal component analysis?
- Tensor Decompositions and Applications
- Tensor-train decomposition
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
- Tensor rank is NP-complete
- Low rank Tucker-type tensor approximation to classical potentials
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss
- Exact Tensor Completion Using t-SVD
- Low-rank tensor completion using matrix factorization based on tensor train rank and total variation
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Nonlocal robust tensor recovery with nonconvex regularization
- Low-Tubal-Rank Tensor Completion Using Alternating Minimization
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 \(\ell_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
Uses Software
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)
