The following pages link to Xiao Jin Zheng (Q864721):
Displaying 32 items.
- (Q384212) (redirect page) (← links)
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
- Reachability determination in acyclic Petri nets by cell enumeration approach (Q644287) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- On reduction of duality gap in quadratic knapsack problems (Q693132) (← links)
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach (Q742312) (← links)
- Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity (Q864722) (← links)
- A Lagrangian dual and surrogate method for multi-dimensional quadratic knapsack problems (Q1013444) (← links)
- Optimality condition and complexity of order-value optimization problems and low order-value optimization problems (Q1679497) (← links)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- Cell-and-bound algorithm for chance constrained programs with discrete distributions (Q1753452) (← links)
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
- A survey on probabilistically constrained optimization problems (Q1940960) (← links)
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems (Q2393069) (← links)
- Constraint qualification in a general class of Lipschitzian mathematical programming problems (Q2465488) (← links)
- Constraint qualification in a general class of nondifferentiable mathematical programming problems (Q2469910) (← links)
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming (Q2666655) (← links)
- AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS (Q2846489) (← links)
- A note on semidefinite relaxation for 0-1 quadratic knapsack problems (Q2867417) (← links)
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach (Q2940060) (← links)
- (Q3052563) (← links)
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program (Q3105771) (← links)
- Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming (Q3169124) (← links)
- (Q3415465) (← links)
- (Q4906120) (← links)
- (Q4927866) (← links)
- (Q4963647) (← links)
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs (Q4995063) (← links)
- An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems (Q5085476) (← links)
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (Q5348460) (← links)
- (Q5402622) (← links)
- Generalized ( ,α, ρ, θ)–<i>d</i>–<i>V</i>–univex functions and non-smooth alternative theorems (Q5852131) (← links)
