| An enhanced SDR based global algorithm for nonconvex complex quadratic programs with signal processing applications C Lu, YF Liu, J Zhou IEEE Open Journal of Signal Processing 1, 120-134, 2020 | 22 | 2020 |
| A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming C Lu, Z Deng, J Zhou, X Guo Journal of Global Optimization 73, 371-388, 2019 | 16 | 2019 |
| A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints J Zhou, Z Xu Optimization Letters 13 (7), 1615-1630, 2019 | 9 | 2019 |
| Conic approximation to quadratic optimization with linear complementarity constraints J Zhou, SC Fang, W Xing Computational Optimization and Applications 66 (1), 97-122, 2017 | 9 | 2017 |
| An efficient global algorithm for nonconvex complex quadratic problems with applications in wireless communications C Lu, YF Liu, J Zhou 2017 IEEE/CIC International Conference on Communications in China (ICCC), 1-5, 2017 | 7 | 2017 |
| A CONIC APPROXIMATION METHOD FOR THE 0-1 QUADRATIC KNAPSACK PROBLEM. J Zhou, D Chen, Z Wang, W Xing Journal of Industrial & Management Optimization 9 (3), 2013 | 7 | 2013 |
| A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program J Zhou, S Chen, S Yu, Y Tian Optimization 71 (9), 2529-2545, 2022 | 5 | 2022 |
| Boundedness analysis of neutral stochastic differential systems with mixed delays L Xu, JJ Suo, J Zhou, H Hu Applied Mathematics Letters 122, 107545, 2021 | 5 | 2021 |
| A SOCP relaxation based branch-and-bound method for generalized trust-region subproblem. J Zhou, C Lu, Y Tian, X Tang Journal of Industrial & Management Optimization 17 (1), 2021 | 5 | 2021 |
| A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs. J Zhou, Z Deng Journal of Industrial & Management Optimization 16 (5), 2020 | 4 | 2020 |
| A global optimization algorithm for solving linearly constrained quadratic fractional problems Z Xu, J Zhou Mathematics 9 (22), 2981, 2021 | 3 | 2021 |
| A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints J Zhou Mathematical Problems in Engineering 2020 (1), 5717301, 2020 | 2 | 2020 |
| Detection of a copositive matrix over a p-th order cone J Zhou, Z Deng, SC Fang, W Xing Pacific Journal of Optimization 10 (3), 593-611, 2014 | 2 | 2014 |
| A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues J Zhou, D Zhang, L Wang, Z Xu Journal of Computational and Applied Mathematics 423, 114944, 2023 | | 2023 |
| A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint Z Xu, J Zhou Computational Optimization and Applications 85 (1), 247-261, 2023 | | 2023 |
Zhijun XuNanyang Technological University/Nankai University/Zhejiang University of Technology/CUST在 ntu.edu.sg 的电子邮件经过验证
