谢家新 - 北京航空航天大学

个人简介

教育背景 2008.09-2012.06 湖南大学数学学院学士 2010.09-2011.06 山东大学数学学院交流培养 2012.09-2017.06 湖南大学数学学院博士工作简历 2017.07-2019.06 中国科学院数学与系统科学研究院博士后 2019.06-至今北京航空航天大学数学科学学院科研项目北京航空航天大学，青年拔尖，数据科学中的几类数学问题及应用研究，2022，主持国家自然科学基金，青年基金, 与交错多项式族相关的若干问题研究，2021-01至2023-12，主持国家自然科学基金，面上项目，基于压缩感知的具有稀疏展开的多元函数的恢复，2021-01至2024-12，参加北京市自然科学基金，重点研究专题，基于实际观测类型图像重建的理论和算法，2019-01至2022-12，参加中国博士后科学基金，面上资助，无相位信息下的信号重构问题研究，2017-11至2019-06，主持中国博士后科学基金，中科院“率先行动”优秀博士后项目，稀疏恢复中的若干理论和算法研究，2017-07至2019-06，主持

近期论文

查看导师新发文章（温馨提示：请注意重名现象，建议点开原文通过作者单位确认）

On greedy multi-step inertial randomized Kaczmarz method for solving linear systems，with Yansheng Su, Yun Zeng, Deren Han, arXiv: , 2023 Fast stochastic dual coordinate descent algorithms for linearly constrained convex optimization, with Yun Zeng, Deren Han, Yansheng Su, arXiv: , 2023 The linear convergence of the greedy randomized Kaczmarz method is deterministic, with Yansheng Su, Yun Zeng, Deren Han, arXiv: , 2023 On adaptive stochastic heavy ball momentum for solving linear systems, with Yun Zeng, Deren Han, Yansheng Su, arXiv:2305.05482, 2023 Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems, with Yun Zeng, Deren Han, Yansheng Su, Numerical Algorithms, https://doi.org/10.1007/s11075-023-01540-x, 2023. A greedy randomized average block projection method for linear feasibility problems, with Lin Zhu, Yuan Lei, arXiv:2211.10331, 2023. The sequential quadratic programming for symmetric pareto eigenvalue complementarity problem, with Lin Zhu, Yuan Lei, to appear in Pacific Journal of Optimization, 2023 On pseudoinverse-free randomized methods for linear systems: Unified framework and acceleration, with Deren Han, arXiv:2208.05437 Randomized Douglas-Rachford method for linear systems: Improved accuracy and efficiency, with Deren Han and Yansheng Su, arXiv:2207.04291 Graph Sparsification by Universal Greedy Algorithms, with Ming-jun Lai, Zhiqiang Xu, Journal of Computational Mathematics, 41 (2023), pp. 741-770. A note on restricted invertibility with weighted columns, arXiv: 2005.01070 Upper and lower bounds for matrix discrepancy, with Zhiqiang Xu and Ziheng Zhu, Journal of Fourier Analysis and Applications, 28, 81 (2022) A symmetric alternating minimization algorithm for total variation minimization, with Yuan Lei, Signal Processing, 176, 2020, 107673 Subset Selection for Matrices with Fixed Blocks, with Zhiqiang Xu, Israel Journal of Mathematics, 245, 1 (2021) Positive operators on extended second order cones, with Sándor Németh and Guohan Zhang, Acta Mathematica Hungarica, 160, 390–404 (2020) On inexact ADMMs with relative error criteria, Computational Optimization and Applications, 2018, 71(3): 743-765 A new accelerated alternating minimization method for analysis sparse recovery, with Anping Liao, Yuan Lei, Signal Processing, 2018, 145: 167-174. An inexact alternating direction method of multipliers with relative error criteria, with Anping Liao and Xiaobo Yang, Optimization Letters, 2017, 11(3): 583-596. 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. 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. Number of Solution for the Sparse Signal Recovery Problem，with Anping Liao, Miao Yang and Kun Shen, Chinese Journal of Engineering Mathematics, 2015 32(5): 643-649. 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.