The accelerated tensor Kaczmarz algorithm with adaptive parameters for solving tensor systems
From MaRDI portal
Publication:6577586
DOI10.1016/J.APNUM.2024.04.016zbMATH Open1543.65037MaRDI QIDQ6577586FDOQ6577586
Authors: Yimou Liao, W. Li, Dan Yang
Publication date: 24 July 2024
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
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
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Multilinear algebra, tensor calculus (15A69) Iterative numerical methods for linear systems (65F10) Computing methodologies for image processing (68U10)
Cites Work
- A randomized Kaczmarz algorithm with exponential convergence
- Factorization strategies for third-order tensors
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- A tensor-based dictionary learning approach to tomographic image reconstruction
- Some methods of speeding up the convergence of iteration methods
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Two-subspace projection method for coherent overdetermined systems
- On greedy randomized average block Kaczmarz method for solving large linear systems
- On greedy randomized block Kaczmarz method for consistent linear systems
- Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems
- Randomized block Kaczmarz method with projection for solving least squares
- Facial recognition using tensor-tensor decompositions
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- Randomized Kaczmarz with averaging
- The generalized inverses of tensors and an application to linear models
- Regularized Kaczmarz Algorithms for Tensor Recovery
- Stochastic gradient descent with Polyak's learning rate
- Tensor Factorization for Low-Rank Tensor Completion
- The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- On unifying multi-view self-representations for clustering by tensor multi-rank minimization
- Faster randomized block Kaczmarz algorithms
- Tensor Arnoldi-Tikhonov and GMRES-type methods for ill-posed problems with a t-product structure
- The tensor Golub–Kahan–Tikhonov method applied to the solution of ill‐posed problems with a t‐product structure
- Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method
- Randomized Kaczmarz for tensor linear systems
- Tensor neural network models for tensor singular value decompositions
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- Sketch‐and‐project methods for tensor linear systems
- Nonconvex multi-view subspace clustering via simultaneously learning the representation tensor and affinity matrix*
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)