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
Ying He
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.
Speaker Intro
左钱，2022年6月毕业于武汉大学，获计算数学博士学位；2022年7月进入北京大学计算机学院前沿计算研究中心进行博士后研究，2024年12月进入安徽大学工作。研究兴趣包括随机算法、量子算法、受量子启发的经典算法等，目前主持国家自然科学基金青年基金项目1项，主持计算科学湖北省重点实验室开放课题基金项目1项，参与国家自然科学基金重大研究计划项目、面上项目。现已在Numerical Algorithms、Journal of Computational and Applied Mathematics、Numerical Linear Algebra with Applications等计算数学专业杂志上发表SCI论文8篇。