首页

当前您的位置: 首页 > 学术讲座 > 正文

Nonconvex Regularization Methods for Low Rank Matrix Recovery

发布日期:2026-07-26点击: 发布人:统计与数学学院

报告题目:Nonconvex Regularization Methods for Low Rank Matrix Recovery

主讲人:胡耀华教授(深圳大学)

时间:2026年7月28日(周二)15:00 p.m.

地点:北院卓远楼305会议室

主办单位:统计与数学学院

摘要:

Low rank matrix recovery, aiming to find a low rank solution from the linear measurements, has a wide range of applications. In this talk, we will present the nonconvex regularization methods for the low rank matrix recovery problem in three aspects: theory, algorithm and application. In the theoretical aspect, by introducing a notion of spectral regularity condition, we will establish the global recovery bound for the nonconvex regularization problem. In the algorithmic aspect, we will apply the well-known proximal gradient method to solve the nonconvex regularization problem, and establish its linear convergence rate to the ground true low rank solution under a simple assumption. In the aspect of application, we will apply the nonconvex regularization method to solve genotype imputation problem for single-cell RNA-sequencing data.

主讲人简介:

胡耀华,深圳大学数学科学学院特聘教授,副院长,博士生导师,香港理工大学兼职博导。主要从事连续优化理论、方法与应用研究,代表性成果发表在SIAM Journal on Optimization, Mathematical Programming, Mathematics of Operations Research, Inverse Problems, Journal of Machine Learning Research, Genome Biology, Bioinformatics等期刊,授权多项国家发明专利,开发多个生物信息学工具包与数据库。