default search action
Fengmin Xu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]Zhihua Allen-Zhao
, Fengmin Xu, Yu-Hong Dai, Sanyang Liu:
Robust enhanced indexation optimization with sparse industry layout constraint. Comput. Oper. Res. 161: 106420 (2024) - 2023
- [j26]Fengmin Xu
New insights and augmented Lagrangian algorithm for optimal portfolio liquidation with market impact. Int. Trans. Oper. Res. 30(5): 2640-2664 (2023) - [j25]Kui Jing
Data-trading coordination with government subsidy. J. Glob. Optim. 87(2): 877-915 (2023) - 2022
- [j24]Kui Jing
A bi-level programming framework for identifying optimal parameters in portfolio selection. Int. Trans. Oper. Res. 29(1): 87-112 (2022) - 2021
- [j23]Ripeng Huang, Shaojian Qu, Xiaoguang Yang, Fengmin Xu, Zeshui Xu, Wei Zhou:
Sparse portfolio selection with uncertain probability distribution. Appl. Intell. 51(10): 6665-6684 (2021) - [j22]Zhi-Long Dong
On some extended mixed integer optimization models of the Eisenberg-Noe model in systemic risk management. Int. Trans. Oper. Res. 28(6): 3014-3037 (2021) - 2020
- [j21]Ya-Feng Liu, Fengmin Xu, Neng Fan, Jiming Peng:
Preface: special issue of MOA 2018. J. Glob. Optim. 76(4): 661-663 (2020) - [j20]Zhi-Long Dong, Fengmin Xu, Yu-Hong Dai:
Fast algorithms for sparse portfolio selection considering industries and investment styles. J. Glob. Optim. 78(4): 763-789 (2020)
2010 – 2019
- 2019
- [j19]Zhihua Zhao
A sparse enhanced indexation model with norm and its alternating quadratic penalty method. J. Oper. Res. Soc. 70(3): 433-445 (2019) - [i1]Jianchao Bai, Xiaokai Chang, Jicheng Li, Fengmin Xu:
Convergence Revisit on Generalized Symmetric ADMM. CoRR abs/1906.07888 (2019) - 2018
- [j18]Jianchao Bai
Generalized symmetric ADMM for separable convex optimization. Comput. Optim. Appl. 70(1): 129-170 (2018) - [j17]Jianchao Bai
A novel method for a class of structured low-rank minimizations with equality constraint. J. Comput. Appl. Math. 330: 475-487 (2018) - [j16]Fengmin Xu, Meihua Wang
A sparse enhanced indexation model with chance and cardinality constraints. J. Glob. Optim. 70(1): 5-25 (2018) - [j15]Xiaojun Chen, C. T. Kelley
A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization. SIAM J. Sci. Comput. 40(4): A2174-A2199 (2018) - 2017
- [j14]Fengmin Xu, Min Sun, Yuhong Dai:
An adaptive Lagrangian algorithm for optimal portfolio deleveraging with cross-impact. J. Syst. Sci. Complex. 30(5): 1121-1135 (2017) - 2016
- [j13]Zhongming Han, Ke Yang, Fengmin Xu, Dagao Duan:
Probabilistic graphical model for detecting spammers in microblog websites. Int. J. Embed. Syst. 8(1): 12-23 (2016) - [j12]Fengmin Xu, Zhaosong Lu
An efficient optimization approach for a cardinality-constrained index tracking problem. Optim. Methods Softw. 31(2): 258-271 (2016) - 2014
- [j11]Shuanghua Luo, Cheng-Yi Zhang, Fengmin Xu:
The Local Linear M-Estimation with Missing Response Data. J. Appl. Math. 2014: 398082:1-398082:10 (2014) - [j10]Meihua Wang, Cheng Li, Honggang Xue, Fengmin Xu:
A New Portfolio Rebalancing Model with Transaction Costs. J. Appl. Math. 2014: 942374:1-942374:7 (2014) - [j9]Meihua Wang, Fengmin Xu, Guan Wang:
Sparse portfolio rebalancing model based on inverse optimization. Optim. Methods Softw. 29(2): 297-309 (2014) - 2013
- [j8]Fengmin Xu, Shanhe Wang:
A hybrid simulated annealing thresholding algorithm for compressed sensing. Signal Process. 93(6): 1577-1585 (2013) - 2012
- [j7]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) - [j6]Zongben Xu, Xiangyu Chang, Fengmin Xu, Hai Zhang:
L1/2 Regularization: A Thresholding Representation Theory and a Fast Solver. IEEE Trans. Neural Networks Learn. Syst. 23(7): 1013-1027 (2012) - 2011
- [j5]Fengmin Xu, Xusheng Ma, Baili Chen:
A new Lagrangian net algorithm for solving max-bisection problems. J. Comput. Appl. Math. 235(13): 3718-3723 (2011) - 2010
- [j4]Xiaojun Chen
Lower Bound Theory of Nonzero Entries in Solutions of ℓ2-ℓp Minimization. SIAM J. Sci. Comput. 32(5): 2832-2852 (2010)
2000 – 2009
- 2009
- [j3]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) - 2006
- [j2]Fengmin Xu, Chengxian Xu, Honggang Xue:
A multiple penalty function method for solving Max-Bisection problems. Appl. Math. Comput. 173(2): 757-766 (2006) - 2005
- [c1]Fengmin Xu, Chengxian Xu:
A Continuous Method for Solving Multiuser Detection in CDMA. AAIM 2005: 311-319 - 2003
- [j1]Hongwei Liu, Sanyang Liu, Fengmin Xu:
A Tight Semidefinite Relaxation of the MAX CUT Problem. J. Comb. Optim. 7(3): 237-245 (2003)
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-04-25 05:57 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: