Employment History
Professor, 2023 - present
School of Mathematics and Statistics , Beijing Jiaotong University, China
Research Fellow, 2021-2023
Department of EEE, Imperial College London, UK
Teaching Fellow, 2020-2021
Research Fellow, 2017-2020
School of Mathematics, University of Southampton, UK
Education Background
PhD in Operational Research, 2014-2017
School of Mathematics, University of Southampton, UK
MSc in Operational Research, 2011-2014
BSc in Information and Computing Sciences, 2007-2011
Department of Mathematics, Beijing Jiaotong University, China
Research Interests
My research interests include the theory and methods of optimization in the fields of sparse optimization, low-rank matrix optimization, 0/1 loss optimization, bilevel optimization, and machine learning-related optimization.
Selected Publications
Full list of publications can be found here
[10] Shenglong Zhou, Lili Pan, Naihua Xiu, and Geoffrey Ye Li, 0/1 constrained optimization solving sample average approximation for chance constrained programming, Mathematics of Operations Research, 2024. RG, ArXiv, Code[9] Shenglong Zhou and Geoffrey Ye Li, Federated learning via inexact ADMM, IEEE Transactions on Pattern Analysis and Machine Intelligence, 45, 9699-9708, 2023. RG, ArXiv, Code[8] Shenglong Zhou, Sparse SVM for sufficient data reduction, IEEE Transactions on Pattern Analysis and Machine Intelligence, 44, 5560-5571, 2022. RG, ArXiv, Code[7] Shenglong Zhou, Gradient projection newton pursuit for sparsity constrained optimization, Applied and Computational Harmonic Analysis, 61, 75-100, 2022. RG, ArXiv, Code[6] Shenglong Zhou, Ziyan Luo, Naihua Xiu and Geoffrey Ye Li, Computing one-bit compressive sensing via double-sparsity constrained optimization, IEEE Transactions on Signal Processing, 70, 1593-1608, 2022. RG, ArXiv, Code[5] Shenglong Zhou, Lili Pan, Naihua Xiu and Huoduo Qi, Quadratic convergence of smoothing Newton's method for 0/1 loss optimization, SIAM Journal on Optimization, 31, 3184–3211, 2021. RG, ArXiv, Code[4] Shenglong Zhou, Lili Pan, Mu Li, and Meijuan Shang, Newton hard-thresholding pursuit for sparse linear complementarity problem via a new merit function, SIAM Journal on Scientific Computing, 43, A772–A799, 2021. RG, ArXiv, Code[3] Shenglong Zhou, Naihua Xiu and Huoduo Qi, Global and quadratic convergence of Newton hard-thresholding pursuit, Journal of Machine Learning Research, 22, 1−45, 2021. RG, ArXiv, Code[2] Shenglong Zhou, Naihua Xiu and Huoduo Qi, Robust Euclidean embedding via EDM optimization, Mathematical Programming Computation, 12, 337–387, 2019. Code[1] Shenglong Zhou, Naihua Xiu and Huoduo Qi, A fast matrix majorization-projection method for penalized stress minimization with box constraints, IEEE Transactions on Signal Processing, 66, 4331-4346, 2018. Code