default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiaoling Sun 0001
Person information
- affiliation: Fudan University, Shanghai, China
Other persons with the same name
- Xiaoling Sun — disambiguation page
- Xiaoling Sun 0002
![[0000-0001-6847-8949]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-6847-8949")
— Dalian University of Technology, Institute of Science of Science and S&T Management, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j41]Xueting Cui, Xiaoling Sun, Shushang Zhu, Rujun Jiang, Duan Li:
Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method. INFORMS J. Comput. 30(3): 454-471 (2018)- 2017
- [j40]Baiyi Wu, Xiaoling Sun, Duan Li, Xiaojin Zheng:
Quadratic Convex Reformulations for Semicontinuous Quadratic Programming. SIAM J. Optim. 27(3): 1531-1553 (2017) - 2014
- [j39]Xiaojin Zheng, Xiaoling Sun, Duan Li, Jie Sun:
Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach. Comput. Optim. Appl. 59(1-2): 379-397 (2014) - [j38]Xiaojin Zheng, Xiaoling Sun, Duan Li:
Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach. INFORMS J. Comput. 26(4): 690-703 (2014) - [j37]Xiaoling Sun, Ya-Xiang Yuan:
Foreword. Optim. Methods Softw. 29(2): 223 (2014) - 2013
- [j36]Shuhui Ji, Xiaojin Zheng, Xiaoling Sun:
An Improved Convex 0-1 quadratic Program Reformulation for Chance-Constrained quadratic Knapsack Problems. Asia Pac. J. Oper. Res. 30(3) (2013) - [j35]Yong Xia, Ruey-Lin Sheu, Xiaoling Sun, Duan Li:
Tightening a copositive relaxation for standard quadratic optimization problems. Comput. Optim. Appl. 55(2): 379-398 (2013) - [j34]Xiaoling Sun, Duan Li, Shuzhong Zhang:
Preface: Special issue of Journal of Global Optimization for the 8th international conference on optimization: techniques and applications. J. Glob. Optim. 56(4): 1295-1296 (2013) - [j33]Xueting Cui, Xiaojin Zheng, Shushang Zhu, Xiaoling Sun:
Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems. J. Glob. Optim. 56(4): 1409-1423 (2013) - [j32]Jie Sun, Xiaoling Sun, Ya-Xiang Yuan:
Foreword: Special issue on the 8th International Conference on Optimization: Techniques and Applications. Optim. Methods Softw. 28(4): 669 (2013) - [j31]Xiaojin Zheng, Xiaoling Sun, Duan Li:
A note on semidefinite relaxation for 0-1 quadratic knapsack problems. Optim. Methods Softw. 28(4): 930-942 (2013) - 2012
- [j30]Yong Xia, Ruey-Lin Sheu, Xiaoling Sun, Duan Li:
Improved estimation of duality gap in binary quadratic programming using a weighted distance measure. Eur. J. Oper. Res. 218(2): 351-357 (2012) - [j29]Xiaojin Zheng, Xiaoling Sun, Duan Li, Xueting Cui:
Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs. Eur. J. Oper. Res. 221(1): 38-48 (2012) - [j28]Xiaojin Zheng, Xiaoling Sun, Duan Li, Yifan Xu:
On zero duality gap in nonconvex quadratic programming problems. J. Glob. Optim. 52(2): 229-242 (2012) - [j27]Duan Li, Xiaoling Sun, Chunli Liu:
An exact solution method for unconstrained quadratic 0-1 programming: a geometric approach. J. Glob. Optim. 52(4): 797-829 (2012) - [j26]Xiaoling Sun, Chunli Liu, Duan Li, Jianjun Gao:
On duality gap in binary quadratic programming. J. Glob. Optim. 53(2): 255-269 (2012) - [j25]Xiaojin Zheng, Xiaoling Sun, Duan Li, Yifan Xu:
On reduction of duality gap in quadratic knapsack problems. J. Glob. Optim. 54(2): 325-339 (2012) - 2011
- [j24]Duan Li, Xiaoling Sun, Jianjun Gao, Shenshen Gu, Xiaojin Zheng:
Reachability determination in acyclic Petri nets by cell enumeration approach. Autom. 47(9): 2094-2098 (2011) - [j23]Xiaojin Zheng, Xiaoling Sun, Duan Li:
Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations. J. Glob. Optim. 50(4): 695-712 (2011) - [j22]Xiaojin Zheng, Xiaoling Sun, Duan Li:
Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation. Math. Program. 129(2): 301-329 (2011) - [j21]Yong Xia, Xiaoling Sun, Duan Li, Xiaojin Zheng:
On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program. SIAM J. Optim. 21(3): 706-729 (2011) - 2010
- [j20]Hezhi Luo, Xiaoling Sun, Yifan Xu, Huixian Wu:
On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints. J. Glob. Optim. 46(2): 217-232 (2010) - [j19]Xiaojin Zheng, Xiaoling Sun, Duan Li, Yong Xia:
Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming. Math. Oper. Res. 35(4): 864-880 (2010)
2000 – 2009
- 2009
- [j18]Duan Li, Xiaoling Sun, J. Wang, K. I. M. McKinnon:
Convergent Lagrangian and domain cut method for nonlinear knapsack problems. Comput. Optim. Appl. 42(1): 67-104 (2009) - 2008
- [j17]Hezhi Luo, Xiaoling Sun, Huixian Wu:
Convergence properties of augmented Lagrangian methods for constrained global optimization. Optim. Methods Softw. 23(5): 763-778 (2008) - 2007
- [j16]Duan Li, J. Wang, Xiaoling Sun:
Computing exact solution to nonlinear integer programming: Convergent Lagrangian and objective level cut method. J. Glob. Optim. 39(1): 127-154 (2007) - [j15]Hezhi Luo, Xiaoling Sun, Duan Li:
On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization. SIAM J. Optim. 18(4): 1209-1230 (2007) - 2006
- [j14]Ning Ruan, Xiaoling Sun:
An exact algorithm for cost minimization in series reliability systems with multiple component choices. Appl. Math. Comput. 181(1): 732-741 (2006) - [j13]Duan Li, Xiaoling Sun:
Towards Strong Duality in Integer Programming. J. Glob. Optim. 35(2): 255-282 (2006) - [j12]Xiaoling Sun, J. L. Li:
A Branch-and-Bound Based Method for Solving Monotone Optimization Problems. J. Glob. Optim. 35(2): 367-385 (2006) - [j11]Xiaoling Sun, Ning Ruan, Duan Li:
An efficient algorithm for nonlinear integer programming problems arising in series-parallel reliability systems. Optim. Methods Softw. 21(4): 617-633 (2006) - [j10]Duan Li, Xiaoling Sun, F. L. Wang:
Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function. SIAM J. Optim. 17(2): 372-400 (2006) - 2005
- [j9]Duan Li, Xiaoling Sun, Ken McKinnon:
An Exact Solution Method for Reliability Optimization in Complex Systems. Ann. Oper. Res. 133(1-4): 129-148 (2005) - [j8]Xiaoling Sun, F. L. Wang, Duan Li:
Exact Algorithm for Concave Knapsack Problems: Linear Underestimation and Partition Method. J. Glob. Optim. 33(1): 15-30 (2005) - [j7]Xiaoling Sun, Duan Li, K. I. M. McKinnon:
On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization. SIAM J. Optim. 15(4): 1128-1146 (2005) - 2001
- [j6]Duan Li, Xiaoling Sun, M. P. Biswal, F. Gao:
Convexification, Concavification and Monotonization in Global Optimization. Ann. Oper. Res. 105(1-4): 213-226 (2001) - [j5]Duan Li, Xiaoling Sun:
Existence of a Saddle Point in Nonconvex Constrained Optimization. J. Glob. Optim. 21(1): 39-50 (2001) - [j4]Xiaoling Sun, K. I. M. McKinnon, Duan Li:
A convexification method for a class of global optimization problems with applications to reliability optimization. J. Glob. Optim. 21(2): 185-199 (2001) - [j3]Xiaoling Sun, Duan Li:
On the relationship between the integer and continuous solutions of convex programs. Oper. Res. Lett. 29(2): 87-92 (2001) - 2000
- [j2]Duan Li, Xiaoling Sun:
Success Guarantee of Dual Search in Integer Programming: p-th Power Lagrangian Method. J. Glob. Optim. 18(3): 235-253 (2000) - [j1]Xiaoling Sun, Duan Li:
Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation. Math. Oper. Res. 25(4): 625-644 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
