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
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
Tensor Decompositions and Applications
Nuclear norm of higher-order tensors
Factorization strategies for third-order tensors
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
Compressed sensing and best $k$-term approximation
Tensor completion and low-$n$-rank tensor recovery via convex optimization
A mathematical introduction to compressive sensing
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
Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
Multidimensional filtering based on a tensor approach
Global convergence of splitting methods for nonconvex composite optimization
An inexact augmented Lagrangian method for second-order cone programming with applications
Limited-angle CT reconstruction via the $L_1/L_2$ minimization
Accelerated Schemes for the $L_1/L_2$ Minimization
A Scale-Invariant Approach for Sparse Signal Recovery
Tensor $N$-tubal rank and its convex relaxation for low-rank tensor recovery
Total Variation Regularized Tensor RPCA for Background Subtraction From Compressive Measurements
Multi-dimensional imaging data recovery via minimizing the partial sum of tubal nuclear norm
Robust Low-Rank Tensor Recovery via Nonconvex Singular Value Minimization
Multiview clustering of images with tensor rank minimization via nonconvex approach
On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
Robust tensor completion: equivalent surrogates, error bounds, and algorithms
Minimizing $L_1$ over $L_2$ norms on the gradient

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)