activity
20202022
most citedGreedy Block Gauss-Seidel Methods for Solving Large Linear Least Squares Problem

6 citations · 16 across the 13 of their papers we have counts for

collaborators
Showing math.NAShow all

13 papers · 1 filter

math.NA2022

Randomized block subsampling Kaczmarz-Motzkin method

Yanjun Zhang, Hanyu Li

By introducing a subsampling strategy, we propose a randomized block Kaczmarz-Motzkin method for solving linear systems. Such strategy not only determines the block size, but also…

math.NA20221 cited

On sketch-and-project methods for solving tensor equations

Ling Tang, Yanjun Zhang, Hanyu Li

We first propose the regular sketch-and-project method for solving tensor equations with respect to the popular t-product. Then, three adaptive sampling strategies and three corres…

math.NA20222 cited

Greedy capped nonlinear Kaczmarz methods

Yanjun Zhang, Hanyu Li

To solve nonlinear problems, we construct two kinds of greedy capped nonlinear Kaczmarz methods by setting a capped threshold and introducing an effective probability criterion for…

math.NA20222 cited

Greedy randomized sampling nonlinear Kaczmarz methods

Yanjun Zhang, Hanyu Li, Ling Tang

The nonlinear Kaczmarz method was recently proposed to solve the system of nonlinear equations. In this paper, we first discuss two greedy selection rules, i.e., the maximum residu…

math.NA2022

Splitting-based randomized iterative methods for solving indefinite least squares problem

Yanjun Zhang, Hanyu Li

The indefinite least squares (ILS) problem is a generalization of the famous linear least squares problem. It minimizes an indefinite quadratic form with respect to a signature mat…

math.NA2021

Convergence directions of the randomized Gauss--Seidel method and its extension

Yanjun Zhang, Hanyu Li

The randomized Gauss--Seidel method and its extension have attracted much attention recently and their convergence rates have been considered extensively. However, the convergence…