default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChengxian Xu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j22]Lin Qiu, Chengxian Xu, Guohua Zhan:
Cultivation of Service Outsourcing Talents Based on Innovative Cooperation Mode Between Institute and Enterprises. Trans. Edutainment 11: 235-242 (2015)- 2014
- [j21]Shaoping Rui, Chengxian Xu:
An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function. Appl. Math. Comput. 241: 167-182 (2014) - [j20]Shaoping Rui, Chengxian Xu:
A globally and locally superlinearly convergent inexact Newton-GMRES method for large-scale variational inequality problem. Int. J. Comput. Math. 91(3): 578-587 (2014) - 2013
- [j19]Aiqun Huang, Chengxian Xu:
A trust region method for solving semidefinite programs. Comput. Optim. Appl. 55(1): 49-71 (2013) - [j18]Aiqun Huang, Chengxian Xu:
Erratum to: A trust region method for solving semidefinite programs. Comput. Optim. Appl. 55(1): 73 (2013) - 2012
- [j17]Meihua Wang, Chengxian Xu, Fengmin Xu, Honggang Xue:
A mixed 0-1 LP for index tracking problem with CVaR risk constraints. Ann. Oper. Res. 196(1): 591-609 (2012) - [j16]Shaoping Rui, Chengxian Xu:
Inexact non-interior continuation method for monotone semidefinite complementarity problems. Optim. Lett. 6(7): 1411-1424 (2012) - 2011
- [j15]Aiqun Huang, Chengxian Xu, Meihua Wang:
A modified SLP algorithm and its global convergence. J. Comput. Appl. Math. 235(14): 4302-4307 (2011) - 2010
- [j14]Jianzhong Zhang, Chengxian Xu:
Inverse optimization for linearly constrained convex separable programming problems. Eur. J. Oper. Res. 200(3): 671-679 (2010)
2000 – 2009
- 2009
- [j13]Fengmin Xu, Chengxian Xu, Jiuquan Ren:
A Continuation Approach Using NCP Function for Solving Max-Cut Problem. Asia Pac. J. Oper. Res. 26(4): 445-456 (2009) - [r4]Chengxian Xu:
Generalized Total Least Squares. Encyclopedia of Optimization 2009: 1233-1238 - [r3]Chengxian Xu:
Nonlinear Least Squares: Newton-type Methods. Encyclopedia of Optimization 2009: 2619-2626 - [r2]Chengxian Xu:
Nonlinear Least Squares Problems. Encyclopedia of Optimization 2009: 2626-2630 - [r1]Chengxian Xu:
Nonlinear Least Squares: Trust Region Methods. Encyclopedia of Optimization 2009: 2630-2637 - 2007
- [j12]Yueting Yang, Chengxian Xu:
A compact limited memory method for large scale unconstrained optimization. Eur. J. Oper. Res. 180(1): 48-56 (2007) - 2006
- [j11]Fengmin Xu, Chengxian Xu, Honggang Xue:
A multiple penalty function method for solving Max-Bisection problems. Appl. Math. Comput. 173(2): 757-766 (2006) - [j10]Honggang Xue, Chengxian Xu, Zong-Xian Feng:
Mean-variance portfolio optimal problem under concave transaction cost. Appl. Math. Comput. 174(1): 1-12 (2006) - [j9]Yuelin Gao, Chengxian Xu, Yongjian Yang:
An outcome-space finite algorithm for solving linear multiplicative programming. Appl. Math. Comput. 179(2): 494-505 (2006) - [c6]Yuelin Gao, Chengxian Xu, Jimin Li:
Linear Programming Relax-PSO Hybrid Bound Algorithm for a Class of Nonlinear Integer Programming Problems. CIS 2006: 29-35 - 2005
- [j8]Yuelin Gao, Chengxian Xu, Yanjun Wang, Liansheng Zhang:
A new two-level linear relaxed bound method for geometric programming problems. Appl. Math. Comput. 164(1): 117-131 (2005) - [j7]Honggang Xue, Chengxian Xu:
A branch and bound algorithm for solving a class of D-C programming. Appl. Math. Comput. 165(2): 291-302 (2005) - [c5]Fengmin Xu, Chengxian Xu:
A Continuous Method for Solving Multiuser Detection in CDMA. AAIM 2005: 311-319 - [c4]Honggang Xue, Chengxian Xu, Chunping Hu:
An Algorithm for Portfolio's Value at Risk Based on Principal Factor Analysis. AAIM 2005: 381-391 - [c3]Yuelin Gao, Chengxian Xu, Yueting Yang
:
Outcome-Space Branch and Bound Algorithm for Solving Linear Multiplicative Programming. CIS (1) 2005: 675-681 - [c2]Ping Wei, Chengxian Xu, Fengji Zhao:
A Method to Locate the Position of Mobile Robot Using Extended Kalman Filter. CIS (1) 2005: 815-820 - [c1]Xiaoliang He, Chengxian Xu, Chuanchao Zhu:
A New Class of Filled Functions for Global Minimization. CIS (1) 2005: 1088-1093 - 2004
- [j6]Chuansheng Yang, Chengxian Xu:
Properties of Hadamard product of inverse M-matrices. Numer. Linear Algebra Appl. 11(4): 343-354 (2004) - 2001
- [j5]Chengxian Xu, Jianzhong Zhang:
A Survey of Quasi-Newton Equations and Quasi-Newton Methods for Optimization. Ann. Oper. Res. 103(1-4): 213-234 (2001) - [j4]Weitian Chen, Chengxian Xu:
Adaptive nonlinear control with partial overparametrization. Syst. Control. Lett. 44(1): 13-24 (2001) - [j3]Weitian Chen, Chengxian Xu:
Simple robust output-feedback controller for uncertain nonlinear systems. IEEE Trans. Autom. Control. 46(11): 1765-1772 (2001)
1990 – 1999
- 1999
- [j2]Jianzhong Zhang, Chengxian Xu:
Trust region dogleg path algorithms for unconstrained minimization. Ann. Oper. Res. 87: 407-418 (1999) - [j1]Jianzhong Zhang, Chengxian Xu:
A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization. SIAM J. Optim. 9(3): 646-667 (1999)
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 2025-01-09 12:47 CET 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:
