X. L. Sun - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2013

Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problemsX. T. Cui, X. J. Zheng, S. S. Zhu, X. L. Sun. jgo, 56(4):1409-1423, 2013. [doi]

2012

An exact solution method for unconstrained quadratic 0-1 programming: a geometric approachD. Li, X. L. Sun, C. L. Liu. jgo, 52(4):797-829, 2012. [doi]

On duality gap in binary quadratic programmingX. L. Sun, C. L. Liu, D. Li, J. J. Gao. jgo, 53(2):255-269, 2012. [doi]

A small patch antenna using a single CRLH TL unit cellX. L. Sun, J. Zhang, S. W. Cheung, T. I. Yuk. rws 2012: 299-302 [doi]

CPW-coupled-fed elliptical monopole antenna for UWB applicationsJ. Zhang, X. L. Sun, S. W. Cheung, T. I. Yuk, Z. B. Ni. rws 2012: 295-298 [doi]

On reduction of duality gap in quadratic knapsack problemsX. J. Zheng, X. L. Sun, D. Li, Y. F. Xu. jgo, 54(2):325-339, 2012. [doi]

On zero duality gap in nonconvex quadratic programming problemsX. J. Zheng, X. L. Sun, D. Li, Y. F. Xu. jgo, 52(2):229-242, 2012. [doi]

2011

Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representationsX. J. Zheng, X. L. Sun, D. Li. jgo, 50(4):695-712, 2011. [doi]

2010

On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraintsH. Z. Luo, X. L. Sun, Y. F. Xu, H. X. Wu. jgo, 46(2):217-232, 2010. [doi]

2009

Convergent Lagrangian and domain cut method for nonlinear knapsack problemsD. Li, X. L. Sun, J. Wang, K. I. M. McKinnon. coap, 42(1):67-104, 2009. [doi]

2007

Computing exact solution to nonlinear integer programming: Convergent Lagrangian and objective level cut methodD. Li, J. Wang, X. L. Sun. jgo, 39(1):127-154, 2007. [doi]

On the Convergence of Augmented Lagrangian Methods for Constrained Global OptimizationH. Z. Luo, X. L. Sun, D. Li. siamjo, 18(4):1209-1230, 2007. [doi]

2006

Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective FunctionD. Li, X. L. Sun, F. L. Wang. siamjo, 17(2):372-400, 2006. [doi]

Towards Strong Duality in Integer ProgrammingD. Li, X. L. Sun. jgo, 35(2):255-282, 2006. [doi]

A Branch-and-Bound Based Method for Solving Monotone Optimization ProblemsX. L. Sun, J. L. Li. jgo, 35(2):367-385, 2006. [doi]

2005

On Saddle Points of Augmented Lagrangians for Constrained Nonconvex OptimizationX. L. Sun, D. Li, K. I. M. McKinnon. siamjo, 15(4):1128-1146, 2005. [doi]

Exact Algorithm for Concave Knapsack Problems: Linear Underestimation and Partition MethodX. L. Sun, F. L. Wang, D. Li. jgo, 33(1):15-30, 2005. [doi]

2001

Convexification, Concavification and Monotonization in Global OptimizationD. Li, X. L. Sun, M. P. Biswal, F. Gao. anor, 105(1-4):213-226, 2001. [doi]

Existence of a Saddle Point in Nonconvex Constrained OptimizationD. Li, X. L. Sun. jgo, 21(1):39-50, 2001. [doi]

On the relationship between the integer and continuous solutions of convex programsX. L. Sun, D. Li. orl, 29(2):87-92, 2001. [doi]

A convexification method for a class of global optimization problems with applications to reliability optimizationX. L. Sun, K. I. M. McKinnon, D. Li. jgo, 21(2):185-199, 2001. [doi]

2000

Success Guarantee of Dual Search in Integer Programming: p-th Power Lagrangian MethodD. Li, X. L. Sun. jgo, 18(3):235-253, 2000. [doi]

Sign in or sign up to see more results.

runs on WebDSL