arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.12953q-fin.PMmath.OC
收藏

基于近端DCA和SCA的稀疏高阶端口

Sparse High-Order Portfolios via Proximal DCA and SCA

Jinxin Wang, Zengde Deng, Taoli Zheng, Anthony Man-Cho So

摘要:

本文主要研究基数约束下的高阶投资组合优化问题,即,基数约束均值-方差-偏度-峰度模型(MVSKC)。MVSKC模型的优化有两个难点。一个是目标函数是非凸的,另一个是基数约束的组合性质,导致非凸以及不连续。基于基数约束具有凸差分(DC)性质,将基数约束转化为惩罚项,提出了最接近凸差分算法(pDCA)、外推pDCA(pDCAe)和逐次凸逼近(SCA)三种算法来处理惩罚MVSK(PMVSK)公式.此外,这些算法的理论收敛性结果分别建立。真实数据集上的数值实验表明,我们提出的方法在获得高效用和稀疏的解决方案,以及效率方面的时间使用的优越性。

英文摘要:

In this paper, we aim at solving the cardinality constrained high-order portfolio optimization, i.e., mean-variance-skewness-kurtosis model with cardinality constraint (MVSKC). Optimization for the MVSKC model is of great difficulty in two parts. One is that the objective function is non-convex, the other is the combinational nature of the cardinality constraint, leading to non-convexity as well dis-continuity. Based on the observation that cardinality constraint has the difference-of-convex (DC) property, we transform the cardinality constraint into a penalty term and then propose three algorithms including the proximal difference of convex algorithm (pDCA), pDCA with extrapolation (pDCAe) and the successive convex approximation (SCA) to handle the resulting penalized MVSK (PMVSK) formulation. Moreover, theoretical convergence results of these algorithms are established respectively. Numerical experiments on the real datasets demonstrate the superiority of our proposed methods in obtaining high utility and sparse solutions as well as efficiency in terms of time usage.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑