A sampling Kaczmarz-Motzkin algorithm for tensor linear systems
From MaRDI portal
Cites work
- A sampling greedy average regularized Kaczmarz method for tensor recovery.
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- A tensor-based dictionary learning approach to tomographic image reconstruction
- An almost-maximal residual tensor block Kaczmarz method for large tensor linear systems
- Facial recognition using tensor-tensor decompositions
- Factorization strategies for third-order tensors
- Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- Greedy Motzkin–Kaczmarz methods for solving linear systems
- Nonnegative tensor patch dictionary approaches for image compression and deblurring applications
- Randomized block subsampling Kaczmarz-Motzkin method
- Randomized extended average block Kaczmarz method for inconsistent tensor equations under t-product
- Randomized Kaczmarz for tensor linear systems
- Regularized Kaczmarz Algorithms for Tensor Recovery
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
- Sketch‐and‐project methods for tensor linear systems
- Tensor neural network models for tensor singular value decompositions
- Tensor randomized extended Kaczmarz methods for large inconsistent tensor linear equations with t-product
- The accelerated tensor Kaczmarz algorithm with adaptive parameters for solving tensor systems
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
This page was built for publication: A sampling Kaczmarz-Motzkin algorithm for tensor linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254941)
