Xiaojin Zheng

Orcid: 0000-0002-2835-7314

Affiliations:
  • Tongji University, Shanghai, China
  • Fudan University, Shanghai, China
  • Chinese University of Hong Kong


According to our database1, Xiaojin Zheng authored at least 26 papers between 2007 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Cardinality-constrained programs with nonnegative variables and an SCA method.
J. Oper. Res. Soc., 2022

2021
Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs.
INFORMS J. Comput., 2021

An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems.
INFORMS J. Comput., 2021

Quadratic convex reformulations for the portfolio selection problem with Value-at-Risk constraint.
Comput. Ind. Eng., 2021

2019
Physical-Layer Network Coding for the Downlink of Dual Connectivity Scenarios.
Proceedings of the Computing, Communications and IoT Applications, ComComAp 2019, Shenzhen, 2019

2018
Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint.
J. Glob. Optim., 2018

2017
Quadratic Convex Reformulations for Semicontinuous Quadratic Programming.
SIAM J. Optim., 2017

Optimality condition and complexity of order-value optimization problems and low order-value optimization problems.
J. Glob. Optim., 2017

Cell-and-bound algorithm for chance constrained programs with discrete distributions.
Eur. J. Oper. Res., 2017

2014
Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach.
INFORMS J. Comput., 2014

Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach.
Comput. Optim. Appl., 2014

2013
A note on semidefinite relaxation for 0-1 quadratic knapsack problems.
Optim. Methods Softw., 2013

Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems.
J. Glob. Optim., 2013

An Improved Convex 0-1 quadratic Program Reformulation for Chance-Constrained quadratic Knapsack Problems.
Asia Pac. J. Oper. Res., 2013

2012
McPAO: A Distributed Multi-channel Power Allocation and Optimization Algorithm for Femtocells.
Mob. Networks Appl., 2012

On reduction of duality gap in quadratic knapsack problems.
J. Glob. Optim., 2012

On zero duality gap in nonconvex quadratic programming problems.
J. Glob. Optim., 2012

Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs.
Eur. J. Oper. Res., 2012

2011
On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program.
SIAM J. Optim., 2011

Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation.
Math. Program., 2011

Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations.
J. Glob. Optim., 2011

Reachability determination in acyclic Petri nets by cell enumeration approach.
Autom., 2011

2010
Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming.
Math. Oper. Res., 2010

Generalized (, alpha, rho, theta)-<i>d</i>-<i>V</i>-univex functions and non-smooth alternative theorems.
Int. J. Comput. Math., 2010

2007
Constraint qualification in a general class of Lipschitzian mathematical programming problems.
J. Glob. Optim., 2007

Constraint qualification in a general class of nondifferentiable mathematical programming problems.
Comput. Math. Appl., 2007


  Loading...