research
∙
08/01/2023
On greedy multi-step inertial randomized Kaczmarz method for solving linear systems
Recently, the multi-step inertial randomized Kaczmarz (MIRK) method for ...
share
research
∙
07/31/2023
Fast stochastic dual coordinate descent algorithms for linearly constrained convex optimization
The problem of finding a solution to the linear system Ax = b with certa...
research
∙
07/05/2023
The linear convergence of the greedy randomized Kaczmarz method is deterministic
To improve the convergence property of the randomized Kaczmarz (RK) meth...
research
∙
12/31/2022
Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems
We investigate the randomized Kaczmarz method that adaptively updates th...
research
∙
07/10/2022
On finite termination of the generalized Newton method for solving absolute value equations
Motivated by the framework constructed by Brugnano and Casulli [SIAM J. ...
research
∙
11/27/2021
A non-monotone smoothing Newton algorithm for solving the system of generalized absolute value equations
The system of generalized absolute value equations (GAVE) has attracted ...
research
∙
03/30/2021
Convergence on a symmetric accelerated stochastic ADMM with larger stepsizes
In this paper, we develop a symmetric accelerated stochastic Alternating...
research
∙
03/18/2021
A class of inexact modified Newton-type iteration methods for solving the generalized absolute value equations
In Wang et al. (J. Optim. Theory Appl., 181: 216–230, 2019), a class of ...
research
∙
03/17/2021
An inexact Douglas-Rachford splitting method for solving absolute value equations
The last two decades witnessed the increasing of the interests on the ab...
research
∙
01/16/2020
