arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.07368math.OCq-fin.PM
收藏

具有交叉影响的最优投资组合去杠杆问题的有效算法

Effective Algorithms for Optimal Portfolio Deleveraging Problem with Cross Impact

Hezhi Luo, Yuanyuan Chen, Xianye Zhang, Duan Li, Huixian Wu

摘要:

我们研究的最优投资组合去杠杆化(OPD)问题的永久和暂时的价格影响,其目标是最大化的股本,同时满足规定的债务/股本要求。我们考虑了不同资产之间交叉影响的实际情况。然而,由此产生的问题是一个非凸二次规划的二次约束和框约束,这是已知的NP-难。在本文中,我们首先开发了一个连续的凸优化(SCO)方法来解决OPD问题,并证明了SCO算法收敛到其转换问题的KKT点。其次,我们提出了一种有效的OPD问题全局算法,该算法集成了SCO方法、简单凸松弛和分支定界框架,可以在预先指定的$ε$ -公差范围内确定OPD问题的全局最优解。我们建立了我们的算法的整体收敛,并估计其复杂性。我们还进行了数值实验,以证明我们提出的算法的有效性与真实数据和随机生成的中型和大型OPD问题的实例。

英文摘要:

We investigate the optimal portfolio deleveraging (OPD) problem with permanent and temporary price impacts, where the objective is to maximize equity while meeting a prescribed debt/equity requirement. We take the real situation with cross impact among different assets into consideration. The resulting problem is, however, a non-convex quadratic program with a quadratic constraint and a box constraint, which is known to be NP-hard. In this paper, we first develop a successive convex optimization (SCO) approach for solving the OPD problem and show that the SCO algorithm converges to a KKT point of its transformed problem. Second, we propose an effective global algorithm for the OPD problem, which integrates the SCO method, simple convex relaxation and a branch-and-bound framework, to identify a global optimal solution to the OPD problem within a pre-specified $ε$-tolerance. We establish the global convergence of our algorithm and estimate its complexity. We also conduct numerical experiments to demonstrate the effectiveness of our proposed algorithms with both the real data and the randomly generated medium- and large-scale OPD problem instances.

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

↑