Zhening Li is a research fellow in computational optimization. His research interests are in the area of optimization, algorithm design and analysis, with applications including financial engineering, game theory, signal processing, etc. His recent research focuses on algorithms and applications of polynomial optimization and tensor computation problems.
Research Fellow in Computational Optimization
PhD in Systems Engineering and Engineering Management, The Chinese University of Hong Kong, 2011
MA in Mathematics & Financial Engineering, York University, 2003
BSc in Mathematics, Peking University, 1999.
Zhening Li received BSc in Mathematics from Peking University in 1999, MA in Mathematics & Financial Engineering from York University in 2003, and PhD in Systems Engineering and Engineering Management from The Chinese University of Hong Kong in 2011. He has worked at Ningbo Institute of Technology, Zhejiang University from 2003 to 2007, and Shanghai University from 2011.
S. He, Z. Li, and S. Zhang, Approximation Algorithms for Discrete Polynomial Optimization, Journal of the Operations Research Society of China, 1, 3-36, 2013
B. Chen, S. He, Z. Li, and S. Zhang, Maximum Block Improvement and Polynomial Optimization, SIAM Journal on Optimization, 22, 87-107, 2012
S. He, Z. Li, and S. Zhang, Approximation Algorithms for Homogeneous Polynomial Optimization with Quadratic Constraints, Mathematical Programming, 125, 353-383, 2010
Z. Li, S. He, and S. Zhang, Approximation Methods for Polynomial Optimization: Models, Algorithms, and Applications, SpringerBriefs in Optimization, Springer, New York, 2012