报告题目 (Title)：Randomized Kaczmarz Iteration Methods: Algorithmic Extensions and Convergence Theory(随机Kaczmarz迭代方法：算法扩展和收敛理论)
报告人 (Speaker)：白中治教授（中国科学院数学与系统科学研究院）
报告时间 (Time)：2023年10月20日(周五) 8:00
报告地点 (Place)：校本部F309
邀请人(Inviter)：李常品、蔡敏
报告摘要：We review and compare several representative and effective randomized projection iteration methods, including the randomized Kaczmarz method, the randomized coordinate descent method, and their modifications and extensions, for solving the large, sparse, consistent or inconsistent systems of linear equations. We also anatomize, extract, and purify the asymptotic convergence theories of these iteration methods, and discuss, analyze, and summarize their advantages and disadvantages from the viewpoints of both theory and computations.