请升级浏览器版本

你正在使用旧版本浏览器。请升级浏览器以获得更好的体验。

师资队伍







名:谢家新

称:副教授

所属系别:计算科学系

学科专业:计算数学

办公地点:沙河校区主E605-3

电子邮箱:xiejx@buaa.edu.cn

个人主页:https://sites.google.com/view/xiejx

教育背景

l 2008.09-2012.06 湖南大学 数学学院 学士

l 2010.09-2011.06 山东大学 数学学院 交流培养

l 2012.09-2017.06 湖南大学 数学学院 博士


工作简历

l 2017.07-2019.06 中国科学院 数学与系统科学研究院 博士后

l 2019.06-至今 太阳成集团tyc7111cc 太阳成集团tyc7111cc

l 2023.11-2024.01 香港理工大学 应用数学系


科研项目

l 太阳成集团tyc7111cc,青年拔尖,数据科学中的几类数学问题及应用研究2022,主持

l 国家自然科学基金,青年基金, 与交错多项式族相关的若干问题研究,2021-012023-12,主持

l 国家自然科学基金,面上项目,基于压缩感知的具有稀疏展开的多元函数的恢复2021-012024-12,参加

l 北京市自然科学基金,重点研究专题,基于实际观测类型图像重建的理论和算法,2019-012022-12,参加

l 中国博士后科学基金,面上资助,无相位信息下的信号重构问题研究,2017-112019-06,主持

l 中国博士后科学基金,中科院“率先行动”优秀博士后项目,稀疏恢复中的若干理论和算法研究,2017-072019-06,主持


代表作论著

l Randomized iterative methods for generalized absolute value equations: Solvability and error bounds, with Houduo Qi and Deren Han, arXiv:2405.04091, 2024.

l A distributed Douglas-Rachford splitting method for solving linear constrained multi-block nonconvex problems, with Leyu Hu, Xingju Cai, and Deren Han, submitted.

l On greedy multi-step inertial randomized Kaczmarz method for solving linear systemswith Yansheng Su, Yun Zeng, Deren Han, arXiv:  , 2023

l Fast stochastic dual coordinate descent algorithms for linearly constrained convex optimization, with Yun Zeng, Deren Han, Yansheng Su, arXiv: , 2023

l The linear convergence of the greedy randomized Kaczmarz method is deterministic, with Yansheng Su, Yun Zeng, Deren Han, arXiv:  , 2023

l On adaptive stochastic heavy ball momentum for solving linear systems, with Yun Zeng, Deren Han, Yansheng Su, arXiv:2305.05482, to appear in SIAM Journal on Matrix Analysis and Applications.

l Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems, with Yun Zeng, Deren Han, Yansheng Su, Numerical Algorithms, 94, 1403–1420 (2023).

l A greedy randomized average block projection method for linear feasibility problems, with Lin Zhu, Yuan Lei, arXiv:2211.10331, 2023.

l The sequential quadratic programming for symmetric pareto eigenvalue complementarity problem, with Lin Zhu, Yuan Lei, Pacific Journal of Optimization, 19 (4): 579-606, 2023.

l On pseudoinverse-free randomized methods for linear systems: Unified framework and acceleration, with Deren Han, arXiv:2208.05437

l Randomized Douglas-Rachford method for linear systems: Improved accuracy and efficiency, with Deren Han and Yansheng Su, SIAM Journal on Optimization, 34 (1): 1045-1070, 2024.

l Graph Sparsification by Universal Greedy Algorithms, with Ming-Jun Lai, Zhiqiang Xu, Journal of Computational Mathematics, 41 (2023), pp. 741-770.

l A note on restricted invertibility with weighted columns, arXiv: 2005.01070

l Upper and lower bounds for matrix discrepancy, with Zhiqiang Xu and Ziheng Zhu, Journal of Fourier Analysis and Applications, 28, 81 (2022)

l A symmetric alternating minimization algorithm for total variation minimization, with Yuan Lei, Signal Processing, 176, 2020, 107673

l Subset Selection for Matrices with Fixed Blocks, with Zhiqiang Xu, Israel Journal of Mathematics, 245, 1 (2021)

l Positive operators on extended second order cones, with Sándor Németh and Guohan Zhang, Acta Mathematica Hungarica, 160, 390–404 (2020)

l On inexact ADMMs with relative error criteria, Computational Optimization and Applications, 2018, 71(3): 743-765

l A new accelerated alternating minimization method for analysis sparse recovery, with Anping Liao, Yuan Lei, Signal Processing, 2018, 145: 167-174.

l An inexact alternating direction method of multipliers with relative error criteria, with Anping Liao and Xiaobo Yang, Optimization Letters, 2017, 11(3): 583-596.

l A remark on joint sparse recovery with OMP algorithm under restricted isometry property, with Xiaobo Yang and Anping Liao, Applied Mathematics and Computation, 2018, 316: 18-24.

l Analysis of convergence for the alternating direction method applied to joint sparse recovery, with Anping Liao and Xiaobo Yang, Applied Mathematics and Computation, 2015, 269: 548-557.

l Number of Solution for the Sparse Signal Recovery Problemwith Anping Liao, Miao Yang and Kun Shen, Chinese Journal of Engineering Mathematics, 2015 32(5): 643-649.

l The exact recovery of sparse signals via orthogonal matching pursuit, with Anping Liao, Xiaobo Yang and Peng Wang, Journal of Computational Mathematics, 2016, 34(1): 70-80.


教学活动

l 《数值分析》、《应用泛函分析》、《三、四年级研讨课》、《科研课堂》、《数学与统计实验》

l 慕课《应用泛函分析》,感兴趣的同学可以去《学堂在线》注册、关注并学习


推荐链接

l https://www.global-sci.org/intro/article_detail/mc/12005.html

l https://scholar.google.com/citations?user=3tF00NEAAAAJ&hl=zh-CN&oi=ao, this is my google scholar


兴趣爱好

我的个人兴趣包括羽毛球,篮球,扑克牌等,每周大概2-3次的羽毛球或篮球活动。


快速链接

版权所有©2024 太阳成集团tyc7111cc(中国) Macau Sun City
地址:北京市昌平区高教园南三街9号   网站:www.zbsddq.com

Baidu
sogou