Xiao Jin Zheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Xiao Jin Zheng has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Duan Li
School of Data Science, City University of Hong Kong, Hong Kong, China
6 shared publications - Xiao Ling Sun
Fudan University
6 shared publications Y. F. Xu
School of Economics and Management, Tongji University, Shanghai, People’s Republic of China
2 shared publications- Shushang Zhu
Department of Finance and Investment, Sun Yat-Sen Business School, Sun Yat-Sen University, Guangzhou 510275, PR China
1 shared publication Xiaoling Sun
Department of Management Science , School of Management, Fudan University , Shanghai , 200433 , People's Republic of China
1 shared publication- Xueting Cui
Department of Management Science, School of Management, Fudan University, Shanghai 200433, PR China
1 shared publication
Latest Publications
- 1 August 2013
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 28 (4) , 930-942
A note on semidefinite relaxation for 0-1 quadratic knapsack problems
We investigate in this note solution properties of semidefinite programming (SDP) relaxation for 0-1 quadratic knapsack problem (QKP). In particular, we focus on the issue of uniqueness of the optimal solution to the SDP relaxation for QKP. We first give a counterexample which shows that the optimal solution to the SDP relaxation for QKP could be non-unique. This is in contrast with the case of unconstrained 0-1 quadratic problems. A necessary and sufficient condition is then derived to ensure the uniqueness of the optimal solution to the SDP relaxation for QKP.
- 1 August 2013
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 28 (4) , 930-942
A note on semidefinite relaxation for 0-1 quadratic knapsack problems
We investigate in this note solution properties of semidefinite programming (SDP) relaxation for 0-1 quadratic knapsack problem (QKP). In particular, we focus on the issue of uniqueness of the optimal solution to the SDP relaxation for QKP. We first give a counterexample which shows that the optimal solution to the SDP relaxation for QKP could be non-unique. This is in contrast with the case of unconstrained 0-1 quadratic problems. A necessary and sufficient condition is then derived to ensure the uniqueness of the optimal solution to the SDP relaxation for QKP.
- 19 February 2012
- Published by Springer Nature in Journal of Global Optimization
- Vol. 54 (2) , 325-339
On reduction of duality gap in quadratic knapsack problems
- 19 February 2012
- Published by Springer Nature in Journal of Global Optimization
- Vol. 54 (2) , 325-339
On reduction of duality gap in quadratic knapsack problems
- 14 January 2012
- Published by Springer Nature in Journal of Global Optimization
- Vol. 56 (4) , 1409-1423
Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- 14 January 2012
- Published by Springer Nature in Journal of Global Optimization
- Vol. 56 (4) , 1409-1423
Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- 7 June 2011
- Published by Springer Nature in Mathematical Programming
- Vol. 129 (2) , 301-329
Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- 7 June 2011
- Published by Springer Nature in Mathematical Programming
- Vol. 129 (2) , 301-329
Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- 6 February 2011
- Published by Springer Nature in Journal of Global Optimization
- Vol. 52 (2) , 229-242
On zero duality gap in nonconvex quadratic programming problems
- 6 February 2011
- Published by Springer Nature in Journal of Global Optimization
- Vol. 52 (2) , 229-242
On zero duality gap in nonconvex quadratic programming problems
- 11 December 2010
- Published by Springer Nature in Journal of Global Optimization
- Vol. 50 (4) , 695-712
Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations
- 11 December 2010
- Published by Springer Nature in Journal of Global Optimization
- Vol. 50 (4) , 695-712
Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations
- 11 May 2010
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 146 (2) , 463-489
Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach
- 11 May 2010
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 146 (2) , 463-489
Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach