A scale-invariant relaxation in low-rank tensor recovery with an application to tensor completion

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
Tensor Decompositions and Applications
A mathematical introduction to compressive sensing
Factorization strategies for third-order tensors
Multidimensional filtering based on a tensor approach
Tensor $N$-tubal rank and its convex relaxation for low-rank tensor recovery
A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
Multi-dimensional imaging data recovery via minimizing the partial sum of tubal nuclear norm
Compressed sensing and best 𝑘-term approximation
Tensor completion and low-n-rank tensor recovery via convex optimization
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
Global Convergence of Splitting Methods for Nonconvex Composite Optimization
Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
Nuclear norm of higher-order tensors
Total Variation Regularized Tensor RPCA for Background Subtraction From Compressive Measurements
An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications
Minimizing L ₁ over L ₂ norms on the gradient
Accelerated Schemes for the $L_1/L_2$ Minimization
Robust Low-Rank Tensor Recovery via Nonconvex Singular Value Minimization
Multiview Clustering of Images with Tensor Rank Minimization via Nonconvex Approach
A Scale-Invariant Approach for Sparse Signal Recovery
Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization
Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms

This page was built for publication: A scale-invariant relaxation in low-rank tensor recovery with an application to tensor completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556789)