Iterative singular tube hard thresholding algorithms for tensor recovery

DOI10.3934/IPI.2023059MaRDI QIDQ6587556zbMATH OpenFDO

Authors Rachel Grotheer, Shuang Li, Anna Ma, D. Needell, Jing Qin

Publication date 14 August 2024

Published in Inverse Problems and Imaging (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/IPI.2023059

zbMATH Keywords

hard thresholdingimage inpaintingstochastic algorithmtensor completiontubal rank

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Low rank tensor recovery via iterative hard thresholding
• Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery
• Minimum n-rank approximation via iterative hard thresholding
• Iterative hard thresholding for low CP-rank tensor models
• Tensor completion and low-\(n\)-rank tensor recovery via convex optimization

Cites work

• A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion
• A Multilinear Singular Value Decomposition
• Adaptive subgradient methods for online learning and stochastic optimization
• An order-\(p\) tensor factorization with applications in imaging
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Batched Stochastic Gradient Descent with Weighted Sampling
• Factorization strategies for third-order tensors
• Fast image inpainting based on coherence transport
• Hierarchical Super-Resolution-Based Inpainting
• Iterative hard thresholding for low-rank recovery from rank-one projections
• Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
• Low rank tensor recovery via iterative hard thresholding
• Most tensor problems are NP-hard
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Proximal gradient algorithm for nonconvex low tubal rank tensor recovery
• Regularized Kaczmarz Algorithms for Tensor Recovery
• RIP-based performance guarantee for low-tubal-rank tensor recovery
• Stochastic greedy algorithms for multiple measurement vectors
• Tensor Decompositions and Applications
• Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
• Triple decomposition and tensor recovery of third order tensors
• Two-Point Step Size Gradient Methods

Cited in

(6)

• Regularized Kaczmarz Algorithms for Tensor Recovery
• Adaptive tensor networks decomposition for high-order tensor recovery and compression
• Robust Low-Tubal-rank tensor recovery Using Discrete Empirical Interpolation Method with Optimized Slice/Feature Selection
• One-dimensional tensor network recovery
• Grouped tensor low-rank representation for multi-dimensional image recovery
• Stochastic gradient descent for incomplete tensor linear systems

This page was built for publication: Iterative singular tube hard thresholding algorithms for tensor recovery

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