Duan Li

Duan Li

Auto-generated profile, based on publicly available information

Duan Li

School of Data Science, City University of Hong Kong, Hong Kong, China

Research Focus & Metrics

Academic Career Length

40Years (1987-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2000 in Applied Mathematics & Optimization
Verified
Journal Article
Closed access
PDF file
XZX. Y. Zhou
X. Y. Zhou
DLD. Li
D. Li

1 July 2000 in Mathematical Finance
Verified
Journal Article
Closed access
PDF file
DLDuan Li
Duan Li
WNWan‐Lung Ng
Wan‐Lung Ng

15 November 2004 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
EBEr-Wei Bai
Er-Wei Bai
DLDuan Li
Duan Li
The convergence of the iterative identification algorithm for the Hammerstein system has been an open problem for a long time. In this paper, a detailed study is carried out and various convergence properties of the iterative algorithm are derived. It is shown that the iterative algorithm with normalization is convergent in general. Moreover, it is shown that convergence takes place in one step (two least squares iterations) for finite-impulse response Hammerstein models with i.i.d. inputs.

1 January 2008 in European Journal of Operational Research
Verified
Journal Article
Closed access
Tsan-Ming ChoiTsan-Ming Choi
Tsan-Ming Choi
DLDuan Li
Duan Li
HYHoumin Yan
Houmin Yan

1 June 2013 in Operations Research
Verified
Journal Article
Closed access
JGJianjun Gao
Jianjun Gao
DLDuan Li
Duan Li
One long-standing challenge in both the optimization and investment communities is to devise an efficient algorithm to select a small number of assets from an asset pool such that a portfolio objective is optimized. This cardinality constrained investment situation naturally arises due to the presence of various forms of market friction, such as transaction costs and management fees, or even due to the consideration of mental cost. Unfortunately, the combinatorial nature of such a portfolio selection problem formulation makes the exact solution process NP-hard in general. We focus in this paper on the cardinality constrained mean-variance portfolio selection problem. Instead of tailoring such a difficult problem into the general solution framework of mixed-integer programming formulation, we explore the special structures and rich geometric properties behind the mathematical formulation. Applying the Lagrangian relaxation to the primal problem results in a pure cardinality constrained portfolio selection problem, which possesses a symmetric property, and to which geometric approaches can be developed. Different from the existing literature that has primarily focused on some direct relaxations of the cardinality constraint, we consider modifying the objective function to some separable relaxations, which are immune to the hard cardinality constraint. More specifically, we develop efficient lower bounding schemes by using the circumscribed box, the circumscribed ball, and the circumscribed axis-aligned ellipsoid to approximate the objective contour of the problem. In particular, all these cardinality constrained relaxation problems can be solved analytically. Furthermore, we derive efficient polynomial-time algorithms for the corresponding dual search problems. Most promisingly, the lower bounding scheme using the circumscribed axis-aligned ellipsoid leads to a semidefinite programming (SDP) formulation and offers a sharp bound and high-quality feasible solution. By integrating these lower bounding schemes into a branch-and-bound algorithm (BnB), our solution scheme outperforms CPLEX significantly in identifying the exact optimal portfolio.

5 December 2010 in Mathematical Finance
Verified
Journal Article
Closed access
PDF file
XCXiangyu Cui
Xiangyu Cui
DLDuan Li
Duan Li
Shouyang WangShouyang Wang
Shouyang Wang
SZShushang Zhu
Shushang Zhu