Book

  1. D. Li and X. L. Sun, Nonlinear Integer Programming, Springer, New York, 2006,xxii+435 pp. ISBN: 978-0387-29503-9; 0-387-29503-8. Series:  International Series in Operations Research & Management Science, Vol. 84. (Link to Springer website)

Selected Papers in International Journals

  1. D. Li, X. L. Sun, J. Wang and K. McKinnon, Convergent Lagrangian and domain cut method for nonlinear  knapsack  problems,  accepted for publication in Computational Optimization and  Applications, 2007.
  2. X. L. Sun, H. B. Sheng and D. Li, An exact algorithm for 0-1 polynomial knapsack problems, Journal of Industrial and Management Optimization, Vol.  3(2),  223-232, 2007
  3. D. Li, J. Wang and X. L. Sun, Computing exact solution to nonlinear integer programming: Convergent
    Lagrangian and objective level cut method, accepted for publication in Journal of Global Optimization, 2007.
  4. X. L. Sun, H. Z. Luo and D. Li,  Convexification of nonsmooth monotone functions, accepted for  publication in Journal of Optimization Theory and Applications, 2007.
  5. N. Ruan and X. L. Sun, An exact algorithm for cost minimization in series reliability systems with multiple component choices, Applied Mathematics and Computation, Vol. 181, 732-741, 2006. 
  6. X. L. Sun, J. L. Li, A branch-and-bound based method for solving monotone optimization problems, Journal of Global Optimization, Vol. 35, 367-385, 2006.
  7. D. Li, X. L. Sun, Towards strong duality in  integer programming,  Journal of Global Optimization, Vol. 35, 255-282, 2006.
  8. D. Li, X. L. Sun and F. L. Wang, Convergent Lagrangian and contour-cut method for nonlinear integer  programming with a quadratic objective function, SIAM Journal on Optimization,  Vol. 17(2), 372-400, 2006.
  9. X. L. Sun, N. Ruan and D. Li, An efficient algorithm for nonlinear integer programming problem arising in series-parallel reliability systems,  Optimization Methods and Software,  Vol. 21(4), 617-633, 2006.
  10. D. Li, X. L. Sun and J. Wang,  Optimal lot solution to cardinality constrained mean-variance formulation for portfolio selection,  Mathematical Finance, Vol. 16 (1),  2006, 83-101.
  11. X. L. Sun, F. L. Wang and D. Li,  Exact algorithm for concave knapsack problems: Linear underestimation and partition method,  Journal of Global Optimization, Vol. 33, 15-30, 2005.
  12. X. L. Sun, D. Li and K. McKinnon, "On saddle points of augmented Lagrangians for constrained nonconvex optimization",  SIAM Journal on Optimization, Vol. 15(4), 1128-1148, 2005.
  13.  D. Li, X. L. Sun and K. McKinnon, An exact solution method for reliability optimization in complex systems,   Annals of Operations Research,  Vol.133, 129-148, 2005.
  14. D. Li, X. L. Sun and J. Wang, Convergent Lagrangian methods for separable nonlinear integer programming: Objective level cut and domain cut methods,  in J. K. Karof (editor), Integer Programming: Theory and Practice, Taylor & Francis,  The Operations Research Series,  2005, pp. 19-36.
  15. X. L. Sun, J. L. Li and D. Li,  Convexification and monotone optimization, in Jeyakumar, V. & Rubinov, A.M. (Editors). Continuous Optimization: Current Trends and Modern Applications. Springer,  Series: Applied Optimization, Vol. 99,  ISBN: 0-387-26769-7, 2005, pp. 275-291
  16. X. L. Sun and D. Li, Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems,   Optimization and Engineering, Vol. 3, 53-65, 2002.
  17. X. L. Sun and D. Li, On the relationship between the integer and continuous solutions of convex programs, Operations Research Letters, Vol. 29, 87-92, 2001.
  18. X. L. Sun, K. I. M. McKinnon and D. Li, A convexification method for a class of global optimization problems with applications to reliability optimization, Journal of Global Optimization, Vol. 21, 185-199, 2001.
  19. D. Li and X. L. Sun, Existence of a saddle point in nonconvex  constrained optimization,  Journal of Global Optimization, Vol. 21, 39-51, 2001.
  20. D. Li and X. L. Sun, Convexification and existence of  saddle point in  a p-th power reformulation for nonconvex constrained optimization, Journal of Nonlinear Analysis: Theory and Methods (Series A), Vol. 47, 5611-5622, 2001.
  21. D. Li, X. L. Sun, M. P. Biswal, and F. Gao, Convexification, concavification and monotonization in global optimization,  Annals of Operations Research,  Vol. 105, 213-226, 2001.
  22. X. L. Sun and D. Li, Asymptotic strong duality for bounded integer programming: A Logarithmic-exponential dual formulation,  Mathematics of Operations Research,  Vol. 25(4),  625-644, 2000.
  23. D. Li and X. L. Sun, Success guarantee of dual search in nonlinear integer programming: p-th power Lagrangian method,  Journal of Global Optimization,  18: (3) 235-254, 2000.
  24. D. Li and X. L. Sun, Nonlinear Lagrangian methods in nonlinear constrained optimization, Optimization Methods and Applications, X. Q. Yang (Eds.), Kluwer, pp. 267-277, 2000.
  25. D. Li and X. L. Sun, Local convexification of Lagrangian function in nonconvex optimization, Journal of Optimization Theory and Applications, Vol. 104, pp. 109-120, 2000.
  26. X. L. Sun and D. Li, New dual formulations in constrained integer programming, Progress in Optimization II, X. Q. Yang, A. I. Mees, M. E. Fisher, and L. S. Jennings (Eds.), pp. 79-91, Kluwer, 2000.
  27. X. L. Sun and D. Li, A logarithmic-exponential penalty formulation for nonlinear integer programming, Applied Mathematics Letters , Vol. 12(3), 73-77, 1999.
  28. X. L. Sun and D. Li, Value-estimation function method for constrained global optimization, Journal of Optimization Theory and Applications, Vol. 102, No. 2, 385-409, 1999.
  29. L. S. Zhang and X. L. Sun, An algorithm for minimizing a class of locally Lipschitz functions, Journal of Optimization Theory and Applications, Vol. 90, No. 1, 203-212, 1996.