Beijing Institute of Mathematical Sciences and Applications

• 2023 -      Beijing Institute of Mathematical Sciences and Applications (BIMSA)      Associate Professor
• 2021 - 2022      The Hong Kong Polytechnic University      Research Fellow
• 2018 - 2018      University of California Irvine      Visiting Professor
• 2014 - 2021      Shanghai Jiao Tong University      Associate Professor
• 2013 - 2014      University of Paris 6 (UPMC)      Postdoc
• 2010 - 2012      French National Center for Scientific Research (CNRS) & Stanford University      Junior Researcher
• 2007 - 2010      National Institute of Applied Sciences of Rouen, France      Lecturer

• 2024      Ruo Lin Award (Paper Award)
• 2017      Shanghai teaching achievement award (First prize)
• 2017      MCM/ICM 2017 INFORMS best paper award
• 2016      Outstanding teaching award at Shanghai Jiao Tong University (First prize)
• 2015      Excellent teacher’s award at ParisTech-SJTU

• [1] Y Sun, Y Liu, YS Niu, Understand the Effectiveness of Shortcuts through the Lens of DCA, arXiv preprint arXiv:2412.09853 (2024)
• [2] Yi-Shuai Niu, Hoai An Le Thi, and Dinh Tao Pham, On difference-of-sos and difference-of-convex-sos decompositions for polynomials, SIAM Journal on Optimization, 34(2), 1852-1878 (2024)
• [3] Y.S. Niu, H. Zhang, Power-product matrix: nonsingularity, sparsity and determinant, Linear and Multilinear Algebra, 72(7), 1170-1187 (2024)
• [4] H Zhang, YS Niu, A Boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs, Journal of Optimization Theory and Applications, 201(2), 720-759 (2024)
• [5] H. Zhang, Y.S. Niu, A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Program, Journal of Optimization Theory and Applications, 201(2024), 720-759
• [6] Y.S. Niu, Hybrid Accelerated DC Algorithms for the Asymmetric Eigenvalue Complementarity Problem, arXiv:2305.12076(2024)
• [7] You, Yu, and Yi-Shuai Niu, A variable metric and nesterov extrapolated proximal DCA with backtracking for a composite DC program, Journal of Industrial and Management Optimization, 19(10), 7716-7734 (2023)
• [8] YS Niu, Accelerated DC Algorithms for the Asymmetric Eigenvalue Complementarity Problem, arXiv preprint arXiv:2305.12076 (2023)
• [9] Yu You, and Yi-Shuai Niu, A refined inertial DC algorithm for DC programming, Optimization and Engineering, 24(1), 65-91 (2023)
• [10] Y.S. Niu, An Accelerated DC Programming Approach with Exact Line Search for The Symmetric Eigenvalue Complementarity Problem, arXiv preprint arXiv:2301.09098 (2023)
• [11] Y.S. Niu, Y. You, M.F. Benammour, Y.J. Wang, Parallel DCCUT Algorithms for Mixed-Binary Linear Programs, arXiv:2103.00717(2023)
• [12] Y.S. Niu, On the convergence analysis of DCA, arXiv preprint arXiv:2211.10942 (2022)
• [13] Y.S. Niu, R. Glowinski, Discrete Dynamical System Approaches for Boolean Polynomial Optimization, Journal of Scientific Computing, 92(2), 1-39 (2022)
• [14] Y.S. Niu, H.J. Ji, Optimisation Théorie et Algorithmes, Shanghai Jiao Tong University Press(2022)
• [15] Yi-Shuai Niu, Yu You, Wenxu Xu, Wentao Ding, Junpeng Hu, and Songquan Yao, A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model, Optimization Letters, 15, 1-26 (2021)
• [16] Yi-Shuai Niu, Wentao Ding, Junpeng Hu, Wenxu Xu, and Stephane Canu, Spatio-Temporal Neural Network for Fitting and Forecasting COVID-19, arXiv preprint arXiv:2103.11860 (2021)
• [17] YS Niu, Y You, A Difference-of-Convex Cutting Plane Algorithm for Mixed-Binary Linear Program, arXiv preprint arXiv:2103.00717 (2021)
• [18] Y.S. Niu, X.W. Hu, Y. You, F. Benammour, H. Zhang, Sentence compression via dc programming approach, Advances in Intelligent Systems and Computing, 991, 341-351 (2020)
• [19] Chen Sun, Ye Tian, Liang Gao, Yi-Shuai Niu, Tianlong Zhang, Hua Li, Yuqing Zhang, Zengqi Yue, Nicole Delepine-Gilon, and Jin Yu, Machine Learning Allows Calibration Models to Predict Trace Element Concentration in Soil with Generalized LIBS Spectra, Scientific Reports, 9(1), 11363 (2019)
• [20] YS Niu, J Júdice, HA Le Thi, DT Pham, Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem, Applied Mathematics and Computation, 353, 95-113 (2019)
• [21] Y.S. Niu, Y. You, W.Z. Liu, Parallel DC Cutting Plane Algorithms for Mixed Binary Linear Program, Advances in Intelligent Systems and Computing, 991(2019), 330-340
• [22] Y.S. Niu, Y.J. Wang, H.A. Le Thi, D.T. Pham, High-order moment portfolio optimization via an accelerated difference-of-convex programming approach and sums-of-squares, arXiv preprint arXiv:1906.01509 (2019)
• [23] Y.S. Niu, J.J. Judice, H.A. Lethi, D.T. Pham, Improved DC Programming Approaches for Solving Quadratic Eigenvalue Complementarity Problem, Applied Mathematics and Computation, 353(2019), 95-113
• [24] D.T. Pham, H.A. Le Thi, V.N. Pham, Y.S. Niu, DC Programming Approaches for Discrete Portfolio Optimization Under Concave Transaction Costs, Optimization Letters, 10(2016), 2, 261-282
• [25] Y.S. Niu, J.J. Judice, H.A. Lethi, D.T. Pham, Solving the quadratic eigenvalue complementarity problem by DC programming, Advances in Intelligent Systems and Computing, 359, 203-214 (2015)
• [26] G Ribert, L Vervisch, P Domingo, YS Niu, Hybrid transported-tabulated strategy to downsize detailed chemistry for numerical simulation of premixed flames, Flow, turbulence and combustion, 92(1-2), 175-200 (2014)
• [27] Y.S. Niu, D.T. Pham, DC Programming Approaches for BMI and QMI Feasibility Problems, Advances in Intelligent Systems and Computing, 282(2014), 37-63
• [28] Y.S. Niu, D.T. Pham, H.A. Le Thi and J.J. Judice, Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem, Optimization Methods and Software, 28(4), 812-829 (2013)
• [29] YS Niu, L Vervisch, DT Pham, An optimization-based approach to detailed chemistry tabulation: Automated progress variable definition, Combustion and Flame, 160(4), 776-785 (2013)
• [30] B.M. Ndiaye, H.A. Le Thi, D.T. Pham, Y.S. Niu, DC programming and DCA for large-scale two-dimensional packing problems, Lecture Notes in Computer Science, 7197, 321-330 (2012)
• [31] L Vervisch, YS Niu, G Lodier, P Domingo, Recent developments in turbulent combustion modeling: automated progress variables definition− Ignition combustion regimes after rapid compression, Proceedings of the Seventh International Symposium On Turbulence (2012)
• [32] D.T. Pham, Y.S. Niu, An efficient DC programming approach for portfolio decision with higher moments, Computational Optimization and Applications, 50(3), 525-554 (2011)
• [33] YS Niu, DT Pham, Efficient DC programming approaches for mixed-integer quadratic convex programs, Proceedings of the International Conference on Industrial Engineering and Systems Management (IESM2011), 222-231 (2011)
• [34] YS Niu, Programmation DC & DCA en Optimisation Combinatoire et Optimisation Polynomiale via les Techniques de SDP, INSA de Rouen (2010)
• [35] Y.S. Niu, D.T. Pham, A DC programming approach for mixed-integer linear programs, Communications in Computer and Information Science, 14, 244-253 (2008)

Recruiting

• Educational Background: Strong foundational knowledge in mathematics and/or computer science
• Research Interests: Keen interest in optimization theory and algorithms, practical applications such as machine learning, finance, data analysis, image processing, quantum information, and high-performance computing.
• Language Skills: Must demonstrate fluency in both spoken and written English.
• Technical Skills: Proficiency in Matlab/Python programming is required.
• Additional Requirements: Postdoc candidates should be early-career researchers who have recently obtained or are about to obtain a PhD within the past five years, the age of the candidate must not beyond 35.