On greedy randomized coordinate descent methods for solving large linear least‐squares problems
From MaRDI portal
Publication:5227183
DOI10.1002/nla.2237zbMath1449.65128OpenAlexW2923102530MaRDI QIDQ5227183
Publication date: 5 August 2019
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.2237
Numerical optimization and variational techniques (65K10) Orthogonalization in numerical linear algebra (65F25)
Related Items (38)
A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems ⋮ Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection ⋮ On greedy randomized average block Kaczmarz method for solving large linear systems ⋮ Stable Computation of Least Squares Problems of the OGM(1,N) Model and Short-Term Traffic Flow Prediction ⋮ On Relaxed Greedy Randomized Augmented Kaczmarz Methods for Solving Large Sparse Inconsistent Linear Systems ⋮ A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems ⋮ On Convergence of the Partially Randomized Extended Kaczmarz Method ⋮ Randomized Kaczmarz methods for tensor complementarity problems ⋮ On the relaxed greedy deterministic row and column iterative methods ⋮ On randomized partial block Kaczmarz method for solving huge linear algebraic systems ⋮ A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems ⋮ An almost-maximal residual tensor block Kaczmarz method for large tensor linear systems ⋮ On adaptive block coordinate descent methods for ridge regression ⋮ Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory ⋮ On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems ⋮ On convergence rates of Kaczmarz-type methods with different selection rules of working rows ⋮ A randomised iterative method for solving factorised linear systems ⋮ On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems ⋮ Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems ⋮ On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems ⋮ On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems ⋮ A note on convergence rate of randomized Kaczmarz method ⋮ Randomized Extended Average Block Kaczmarz for Solving Least Squares ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems ⋮ A doubly stochastic block Gauss-Seidel algorithm for solving linear equations ⋮ A geometric probability randomized Kaczmarz method for large scale linear systems ⋮ A new randomized Gauss-Seidel method for solving linear least-squares problems ⋮ On the error estimate of the randomized double block Kaczmarz method ⋮ On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems ⋮ On the generally randomized extended Gauss-Seidel method ⋮ On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem ⋮ Gauss-Seidel method with oblique direction ⋮ On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems ⋮ On Adaptive Sketch-and-Project for Solving Linear Systems ⋮ On relaxed greedy randomized iterative methods for the solution of factorized linear systems ⋮ On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems ⋮ A Partially Greedy Randomized Extended Gauss-Seidel Method for Solving Large Linear Systems
Uses Software
This page was built for publication: On greedy randomized coordinate descent methods for solving large linear least‐squares problems
