Fast algorithms for non-convex tensor completion problems
From MaRDI portal
Cites work
- A fast randomized algorithm for the approximation of matrices
- A new convex optimization model for multiplicative noise and blur removal
- A non-convex tensor rank approximation for tensor completion
- A Singular Value Thresholding Algorithm for Matrix Completion
- Alternating direction method with Gaussian back substitution for separable convex programming
- An order-\(p\) tensor factorization with applications in imaging
- Coupled segmentation and denoising/deblurring models for hyperspectral material identification.
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Factorization strategies for third-order tensors
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- L 1/2 regularization
- Matrix factorization for low-rank tensor completion using framelet prior
- Parallel matrix factorization for low-rank tensor completion
- Randomized algorithms for the low-rank approximation of matrices
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor Decompositions and Applications
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- Tensor-train decomposition
- Third-order tensors as linear operators on a space of matrices
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
This page was built for publication: Fast algorithms for non-convex tensor completion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977525)
