BIMSA >
BIMSA Lecture
On the Polyak momentum variants of the greedy deterministic single and multiple row-action methods
On the Polyak momentum variants of the greedy deterministic single and multiple row-action methods
Organizer
Speaker
Qian Zuo
Time
Thursday, July 10, 2025 10:30 AM - 11:30 AM
Venue
A3-2-301
Online
Zoom 537 192 5549
(BIMSA)
Abstract
For solving a consistent system of linear equations, the classical row-action method, such as Kaczmarz method, is a simple while really effective iteration solver. Based on the greedy index selection strategy and Polyak's heavy-ball momentum acceleration technique, we propose two deterministic row-action methods and establish the corresponding convergence theory. We show that our algorithm can linearly converge to a least-squares solution with minimum Euclidean norm. Several numerical studies have been presented to corroborate our theoretical findings. Real-world applications, such as data fitting in computer-aided geometry design, are also presented for illustrative purposes.