Yansheng Su

According to our database, Yansheng Su authored at least 8 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Stochastic dual coordinate descent with adaptive heavy ball momentum for linearly constrained convex optimization.

Yun Zeng, Deren Han, Yansheng Su, Jiaxin Xie

Numerische Mathematik, April, 2026

2024

Randomized Douglas-Rachford Methods for Linear Systems: Improved Accuracy and Efficiency.

Deren Han, Yansheng Su, Jiaxin Xie

SIAM J. Optim., March, 2024

On Adaptive Stochastic Heavy Ball Momentum for Solving Linear Systems.

Yun Zeng, Deren Han, Yansheng Su, Jiaxin Xie

SIAM J. Matrix Anal. Appl., 2024

On adaptive stochastic extended iterative methods for solving least squares.

Yun Zeng, Deren Han, Yansheng Su, Jiaxin Xie

CoRR, 2024

2023

Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems.

Yun Zeng, Deren Han, Yansheng Su, Jiaxin Xie

Numer. Algorithms, November, 2023

On greedy multi-step inertial randomized Kaczmarz method for solving linear systems.

Yansheng Su, Deren Han, Yun Zeng, Jiaxin Xie

CoRR, 2023

Fast stochastic dual coordinate descent algorithms for linearly constrained convex optimization.

Zeng Yun, Deren Han, Yansheng Su, Jiaxin Xie

CoRR, 2023

The linear convergence of the greedy randomized Kaczmarz method is deterministic.

Yansheng Su, Deren Han, Yun Zeng, Jiaxin Xie

CoRR, 2023