Xia Yong

Yong Xia

Information about the author Yong Xia will soon be added to the site.
Found 9 papers in total
New results on semidefinite bounds for l1‐constrained nonconvex quadratic optimization
New results on semidefinite bounds for l1‐constrained nonconvex quadratic optimization
2013
In this paper, we show that the direct semidefinite programming (SDP) bound for the...
Tightening a copositive relaxation for standard quadratic optimization problems
Tightening a copositive relaxation for standard quadratic optimization problems
2013
We focus in this paper the problem of improving the semidefinite programming (SDP)...
Duality and solutions for quadratic programming over single non‐homogeneous quadratic constraint
Duality and solutions for quadratic programming over single non‐homogeneous quadratic constraint
2012
This paper extends and completes the discussion by Xing et al. (Canonical dual...
Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
2012
We present in this paper an improved estimation of duality gap between binary...
Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming
Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming
2010
We investigate in this paper the Lagrangian duality properties of linear equality...
Convex hull presentation of a quadratically constrained set and its application in solving quadratic programming problems
Convex hull presentation of a quadratically constrained set and its application in solving quadratic programming problems
2009
In this article, we study the convex hull presentation of a quadratically constrained...
An efficient continuation method for quadratic assignment problems
An efficient continuation method for quadratic assignment problems
2010
In this article, we propose a Lagrangian smoothing algorithm for quadratic assignment...
New optimality conditions for quadratic optimization problems with binary constraints
New optimality conditions for quadratic optimization problems with binary constraints
2009
In this article, we obtain new sufficient optimality conditions for the nonconvex...
A new linearization method for quadratic assignment problems
A new linearization method for quadratic assignment problems
2006
The quadratic assignment problem (QAP) is one of the great challenges in combinatorial...
Papers per page: