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

用逐次凸逼近算法求解高阶组合问题

Solving High-Order Portfolios via Successive Convex Approximation Algorithms

Rui Zhou, Daniel P. Palomar

摘要:

投资组合收益率的第一矩和第二矩,也就是均值和方差已被广泛用于评估投资组合的预期收益和风险。投资者在设计投资组合时追求更高的均值和更低的方差。当投资组合收益率服从高斯分布时,这两个矩可以很好地描述收益率的分布。然而,现实世界中的资产收益率分布往往是不对称的、重尾的,远非高斯分布。非对称性和重尾性的特征在于第三和第四中心矩,即,偏度和峰度。较高的偏度和较低的峰度是优选的,以减少极端损失的概率。然而,将高阶矩的投资组合设计是非常困难的,由于他们的非凸性和快速增加的计算成本与维。在本文中,我们提出了一个非常有效的和收敛性证明的算法框架的基础上逐次凸近似(SCA)算法来解决高阶投资组合。数值实验证明了该算法框架的有效性。

英文摘要:

The first moment and second central moments of the portfolio return, a.k.a. mean and variance, have been widely employed to assess the expected profit and risk of the portfolio. Investors pursue higher mean and lower variance when designing the portfolios. The two moments can well describe the distribution of the portfolio return when it follows the Gaussian distribution. However, the real world distribution of assets return is usually asymmetric and heavy-tailed, which is far from being a Gaussian distribution. The asymmetry and the heavy-tailedness are characterized by the third and fourth central moments, i.e., skewness and kurtosis, respectively. Higher skewness and lower kurtosis are preferred to reduce the probability of extreme losses. However, incorporating high-order moments in the portfolio design is very difficult due to their non-convexity and rapidly increasing computational cost with the dimension. In this paper, we propose a very efficient and convergence-provable algorithm framework based on the successive convex approximation (SCA) algorithm to solve high-order portfolios. The efficiency of the proposed algorithm framework is demonstrated by the numerical experiments.

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

↑