Block matrix and tensor randomized Kaczmarz methods for linear feasibility problems
From MaRDI portal
Cites work
- A Randomized Solver for Linear Systems with Exponential Convergence
- A randomized Kaczmarz algorithm with exponential convergence
- A sampling greedy average regularized Kaczmarz method for tensor recovery.
- An easily computable upper bound on the Hoffman constant for homogeneous inequality systems
- An order-\(p\) tensor factorization with applications in imaging
- Approximations to Solutions to Systems of Linear Inequalities
- Block Kaczmarz method with inequalities
- Block-iterative methods for consistent and inconsistent linear equations
- Error bounds in mathematical programming
- Exact Tensor Completion Using t-SVD
- Factorization strategies for third-order tensors
- Hoffman's least error bounds for systems of linear inequalities
- Nonnegative tensor patch dictionary approaches for image compression and deblurring applications
- On multivariate trace inequalities of Sutter, Berta, and Tomamichel
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Paving the Way for Consensus: Convergence of Block Gossip Algorithms
- Randomized Kaczmarz for tensor linear systems
- Randomized methods for linear constraints: convergence rates and conditioning
- Regularized Kaczmarz Algorithms for Tensor Recovery
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- The Probability That a Numerical Analysis Problem is Difficult
- 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: Block matrix and tensor randomized Kaczmarz methods for linear feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891544)
