6 citations · 17 across the 15 of their papers we have counts for
6 papers · 1 filter
Block sampling Kaczmarz-Motzkin methods for consistent linear systems
Yanjun Zhang, Hanyu Li
The sampling Kaczmarz-Motzkin (SKM) method is a generalization of the randomized Kaczmarz and Motzkin methods. It first samples some rows of coefficient matrix randomly to build a…
Greedy Motzkin-Kaczmarz methods for solving linear systems
Yanjun Zhang, Hanyu Li
The famous greedy randomized Kaczmarz (GRK) method uses the greedy selection rule on maximum distance to determine a subset of the indices of working rows. In this paper, with the…
A novel greedy Gauss-Seidel method for solving large linear least squares problem
Yanjun Zhang, Hanyu Li
We present a novel greedy Gauss-Seidel method for solving large linear least squares problem. This method improves the greedy randomized coordinate descent (GRCD) method proposed r…
A Count Sketch Kaczmarz Method For Solving Large Overdetermined Linear Systems
Yanjun Zhang, Hanyu Li
In this paper, combining count sketch and maximal weighted residual Kaczmarz method, we propose a fast randomized algorithm for large overdetermined linear systems. Convergence ana…
Greedy Block Gauss-Seidel Methods for Solving Large Linear Least Squares Problem
Hanyu Li, Yanjun Zhang
With a greedy strategy to construct control index set of coordinates firstly and then choosing the corresponding column submatrix in each iteration, we present a greedy block Gauss…
A Novel Greedy Kaczmarz Method For Solving Consistent Linear Systems
Hanyu Li, Yanjun Zhang
With a quite different way to determine the working rows, we propose a novel greedy Kaczmarz method for solving consistent linear systems. Convergence analysis of the new method is…