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

DOI10.1137/23M1560847MaRDI QIDQ6556789zbMATH OpenFDO

Authors Huiwen Zheng, Yifei Lou, Guo-Liang Tian, Chao Wang

Publication date 17 June 2024

Published in SIAM Journal on Imaging Sciences (Search for Journal in Brave)

zbMATH Keywords

tensor completionnull space propertytensor singular value decompositiontensor tubal rank

Mathematics Subject Classification ID

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

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

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)