RIP-based performance guarantee for low-tubal-rank tensor recovery
From MaRDI portal
Publication:2306402
Recommendations
- Iterative hard thresholding for low CP-rank tensor models
- Multi-dimensional imaging data recovery via minimizing the partial sum of tubal nuclear norm
- Low rank tensor recovery via iterative hard thresholding
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor \(N\)-tubal rank and its convex relaxation for low-rank tensor recovery
Cites work
- A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
- An order-\(p\) tensor factorization with applications in imaging
- Compressive Sensing of Sparse Tensors
- Decoding by Linear Programming
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Exact Tensor Completion Using t-SVD
- Factorization strategies for third-order tensors
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
- Low rank tensor recovery via iterative hard thresholding
- Minimization of \(\ell_{1-2}\) for compressed sensing
- One condition for solution uniqueness and robustness of both _1-synthesis and _1-analysis minimizations
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries
- Stable Recovery of Sparse Signals Via Regularized Minimization
- Stable recovery of analysis based approaches
- The restricted isometry property and its implications for compressed sensing
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
Cited in
(9)- One-dimensional tensor network recovery
- Iterative singular tube hard thresholding algorithms for tensor recovery
- Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches
- Robust Low-Tubal-rank tensor recovery Using Discrete Empirical Interpolation Method with Optimized Slice/Feature Selection
- New restricted isometry properties of constrained and unconstrained \(L_{*-F}\) minimization for low-rank approximation
- Nonlocal robust tensor recovery with nonconvex regularization
- Conditions for the equivalence between the low-n-rank tensor recovery problem and its convex relaxation
- RIP-based performance guarantee for low-tubal-rank tensor recovery
- Low tubal-rank tensor recovery with adversarial sparse noises
This page was built for publication: RIP-based performance guarantee for low-tubal-rank tensor recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306402)
