基本信息：
姓名：何洪津
专业：计算数学
职称：教授
E-mail：hehongjin@nbu.edu.cn or hehjmath@hotmail.com
研究方向：
非线性规划 Nonlinear Programming; 变分不等式和互补问题 Variational Inequalities and Complementarity Problems 张量分析与计算 Tensor Analysis and Computation
教育背景：
2007.09-2012.06 南京师范大学 数学科学学院 博士生（导师：孙文瑜教授、韩德仁教授）
2003.09-2007.06 信阳师范学院 数学与统计学院 本科生
工作经历：
2021.05-至今 宁波大学 数学与统计学院
2012.06-2021.05 杭州电子科技大学 理学院
2016.08-2017.01 新疆理工学院（原：新疆大学科学技术学院（阿克苏校区）） 援疆教师
2013.08-2014.08 台湾中山大学 应用数学系 博士后 （导师：徐洪坤教授）
访学经历：
2019.07-2019.08 香港理工大学 应用数学系 （访问：祁力群教授）
2018.11-2019.01 澳大利亚科廷大学 电子工程、计算机和数学科学学院 （访问：周广路教授、Louis Caccetta教授）
2018.07-2018.08 台湾高雄医学大学 非线性分析与优化研究中心 （访问：姚任之教授、温庆丰教授）
2015.07-2015.08 台湾高雄医学大学 非线性分析与优化研究中心（访问：姚任之教授、温庆丰教授）
2015.01-2015.02 台湾高雄医学大学 非线性分析与优化研究中心（访问：姚任之教授、温庆丰教授）
2011.04-2011.08 香港浸会大学 应用数学系 （访问：袁晓明教授）
期刊论文：
Zhiyuan Zhang, Chen Ling, Hongjin He, and Liqun Qi*, A tensor train approach for internet traffic data completion, Annals of Operations Research, doi: 10.1007/s10479-021-04147-4, to appear. Chi-Sheng Chuang, Hongjin He*, and Zhiyuan Zhang, A unified Douglas-Rachford algorithm for generalized DC programming, Journal of Global Optimization, 2022, 82: 331-349. Haibin Chen, Hongjin He*, Yiju Wang, and Guanglu Zhou, An efficient alternating minimization method for fourth degree polynomial optimization, Journal of Global Optimization, 2022, 82: 83-103. Hongjin He, Xueli Bai, Chen Ling, and Guanglu Zhou*, An index detecting algorithm for a class of TCP(A,q) equipped with nonsingular M-tensors, Journal of Computational and Applied Mathematics, 2021, 394: 113548. Zhiyuan Zhang and Hongjin He*, A customized low-rank prior model for structured cartoon-texture image decomposition, Signal Processing: Image Communication, 2021, 96:116308. Chenjian Pan, Chen Ling*, and Hongjin He, Adaptive multi-dimensional low-rank balance methods for tensor completion problems, Pacific Journal of Optimization, 2021, 17: 595-615. Xueli Bai, Hongjin He*, Chen Ling, Guanglu Zhou, A nonnegativity preserving algorithm for multilinear systems with nonsingular M-tensors, Numerical Algorithms, 2021, 87: 1301-1320. Xiaoyu Mao, Hongjin He*, and Hong-Kun Xu, A partially proximal linearized alternating minimization method for finding Dantzig selectors, Computational and Applied Mathematics, 2021, 40:62. Kai Wang and Hongjin He*, A double extrapolation primal-dual algorithm for saddle point problems, Journal of Scientific Computing, 2020, 85, Article Number: 30: 1-30. Chen Ling, Weijie Yan, Hongjin He*, Liqun Qi, Further study on tensor absolute value equations, Science China: Mathematics, 2020, 63: 2137-2156. Wanbin Tong, Hongjin He, Chen Ling*, and Liqun Qi, A nonmonotone spectral projected gradient method for tensor eigenvalue complementarity problems, Numerical Algebra, Control and Optimization, 2020, 10(4):425-437. Liyun Ling, Chen Ling, and Hongjin He*, Properties of the solution set of generalized polynomial complementarity problems, Pacific Journal of Optimization, 2020,16(1): 155-174. Liyun Ling, Chen Ling, and Hongjin He*, Generalized tensor complementarity problems over a polyhedral cone, Asia-Pacific Journal of Operational Research, 2020, 37(4) 2040006(23pages). Weijie Yan, Chen Ling, Liyun Ling, Hongjin He*, Generalized tensor equations with leading structured tensors, Applied Mathematics and Computation, 2019, 361: 311-324. Hongjin He, Chen Ling, Liqun Qi, Guanglu Zhou*, A globally and quadratically convergent algorithm for solving multilinear systems with M-tensors, Journal of Scientific Computing, 2018, 76: 1718-1741. Hongjin He, Liusheng Hou, and Hong-Kun Xu*, A partially isochronous splitting algorithm for three-block separable convex minimization problems, Advances in Computational Mathematics, 2018, 44: 1091-1115. Xihong Yan, Kai Wang, and Hongjin He*, On the convergence rate of scaled gradient projection method, Optimization, 2018, 67: 1365-1376. Peipei Chen, Hongjin He, Yeong-Cheng Liou*, and Ching-Feng Wen, Convergence rate of the CQ algorithm for split feasibility problems, Journal of Nonlinear and Convex Analysis, 2018, 19: 381-395. Liyun Ling, Hongjin He*, and Chen Ling, On error bounds of polynomial complementarity problems with structured tensors, Optimization, 2018, 67: 341-358. Wen Yu, Chen Ling, and Hongjin He, On the properties of tensor complementarity problems, Pacific Journal of Optimization, 2018, 14: 675-691. Hongjin He and Hong-Kun Xu*, Splitting methods for split feasibility problems with application to Dantzig selectors, Inverse Problems, 33 (2017) 055003 (28pp). Hongjin He and Hng-Kun Xu*, Perturbation resilience and superiorization methodology of averaged mappings, Inverse Problems, 2017, 33:044007. Hongjin He, Kai Wang, Xingju Cai, and Deren Han*, An LQP-based two-step method for structured variational inequalities, Journal of the Operations Research Society of China, 2017, 5:301—317. Chen Ling, Hongjin He*, and Liqun Qi, Improved approximation results on standard quartic polynomial optimization, Optimization Letters, 2017,11:1767-1782. Kai Wang, Jitamitra Desai*, and Hongjin He, A proximal partially parallel splitting method for separable convex programs, Optimization Methods and Software, 2017, 32: 39—68. Hongjin He and Deren Han*, A distributed Douglas-Rachford splitting method for multi-block convex minimization problems, Advances in Computational Mathematics, 2016, 42:27-53. Hongjin He, Chen Ling, and Hong-Kun Xu*, An implementable splitting algorithm for the L1-norm regularized split feasibility problem, Journal of Scientific Computing, 2016, 67(1):281-298. Chen Ling, Hongjin He*, and Liqun Qi, On the cone eigenvalue complementarity problem for higher-order tensors, Computational Optimization and Applications, 2016, 63: 143-168. Chen Ling, Hongjin He*, and Liqun Qi, Higher-degree eigenvalue complementarity problems for tensors, Computational Optimization and Applications, 2016, 64: 149-176. Liusheng Hou, Hongjin He, and Junfeng Yang*, A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA, Computational Optimization and Applications, 2016, 63:273-303. Hongjin He, Jitamitra Desai*, and Kai Wang, A primal-dual prediction correction algorithm for saddle point optimization, Journal of Global Optimization, 2016, 66:573—583. Kai Wang, Jitamitra Desai, and Hongjin He*, A note on augmented Lagrangian-based parallel splitting method, Optimization Letters, 2015, 9: 1199-1212. Hongjin He, Xingju Cai*, and Deren Han, A fast splitting method tailored for Dantzig selector, Computational Optimization and Applications, 2015, 62: 347-372. Hongjin He, Xingju Cai, and Deren Han*, A class of nonlinear proximal point algorithms for variational inequality problems, International Journal of Computer Mathematics, 2015, 92: 1385-1401. Hongjin He, Chen Ling, and Hong-Kun Xu*, A relaxed projection method for split variational inequalities, Journal of Optimization Theory and Applications, 2015, 166: 213-233. Hongjin He and Hong-Kun Xu*, A projection-based splitting method for structured variational inequality problems, Journal of Nonlinear and Convex Analysis, 2015, 16: 1539-1556. Deren Han, Hongjin He, Hai Yang, and Xiaoming Yuan*, A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints, Numerische Mathematik, 2014, 127: 167-200. Deren Han*, Hongjin He, and Lingling Xu, A proximal parallel splitting method for minimizing sum of convex functions with linear constraints, Journal of Computational and Applied Mathematics, 2014, 256: 36-51. Hongjin He, Deren Han, Wenyu Sun*, and Yannan Chen, A hybrid splitting method for variational inequality problems with separable structure, Optimization Methods and Software, 2013, 28: 725-742. Hongjin He, Deren Han*, and Zhibao Li, Some projection methods with the BB step sizes for variational inequalities, Journal of Computational and Applied Mathematics, 2012, 236: 2590-2604.
科研项目：
国家自然科学基金面上项目：面向结构型优化问题的并行分裂算法设计及应用，11771113，2018年1月—2021年12月，主持； 浙江省自然科学基金一般项目：结构型DC规划和相关非凸优化问题的分裂算法，LY20A010018，2020年1月—2022年12月（提前结题），主持； 国家自然科学基金青年项目：新算子分裂法及其在可分离优化中的应用，11301123，2014年1月—2016年12月，主持； 浙江省自然科学基金一般项目：求解结构优化问题的若干新型Douglas-Rachford分裂算法研究，LY17A010028，2017年1月—2019年12月（提前结题），主持.
|
