The accelerated tensor Kaczmarz algorithm with adaptive parameters for solving tensor systems
From MaRDI portal
(Redirected from Publication:6577586)
Recommendations
- Randomized Kaczmarz for tensor linear systems
- On greedy randomized Kaczmarz-type methods for solving the system of tensor equations
- Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method
- The accelerated overrelaxation splitting method for solving symmetric tensor equations
- An almost-maximal residual tensor block Kaczmarz method for large tensor linear systems
Cites work
- A randomized Kaczmarz algorithm with exponential convergence
- A tensor-based dictionary learning approach to tomographic image reconstruction
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Facial recognition using tensor-tensor decompositions
- Factorization strategies for third-order tensors
- Faster randomized block Kaczmarz algorithms
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- Nonconvex multi-view subspace clustering via simultaneously learning the representation tensor and affinity matrix*
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- On greedy randomized average block Kaczmarz method for solving large linear systems
- On greedy randomized block Kaczmarz method for consistent linear systems
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On unifying multi-view self-representations for clustering by tensor multi-rank minimization
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized block Kaczmarz method with projection for solving least squares
- Randomized block Kaczmarz methods with k-means clustering for solving large linear systems
- Randomized Kaczmarz for tensor linear systems
- Randomized Kaczmarz with averaging
- Regularized Kaczmarz Algorithms for Tensor Recovery
- Sketch‐and‐project methods for tensor linear systems
- Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method
- Some methods of speeding up the convergence of iteration methods
- Stochastic gradient descent with Polyak's learning rate
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Tensor Arnoldi-Tikhonov and GMRES-type methods for ill-posed problems with a t-product structure
- Tensor Factorization for Low-Rank Tensor Completion
- Tensor neural network models for tensor singular value decompositions
- The generalized inverses of tensors and an application to linear models
- The nonconvex tensor robust principal component analysis approximation model via the weighted _p-norm regularization
- The tensor Golub–Kahan–Tikhonov method applied to the solution of ill‐posed problems with a t‐product structure
- Two-subspace projection method for coherent overdetermined systems
Cited in
(6)- The quaternion relaxed greedy randomized Kaczmarz method with adaptive parameters for solving quaternion matrix equation
- Block matrix and tensor randomized Kaczmarz methods for linear feasibility problems
- Randomized extended average block Kaczmarz method for inconsistent tensor equations under t-product
- Randomized coordinate descent method for inconsistent tensor linear systems with t-product
- A sampling Kaczmarz-Motzkin algorithm for tensor linear systems
- Randomized average block coordinate descent method with heavy-ball momentum for tensor least squares problem under the t-product
This page was built for publication: The accelerated tensor Kaczmarz algorithm with adaptive parameters for solving tensor systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6577586)
