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

通过凸优化实现基于累积前景理论效用的投资组合优化

Portfolio Optimization with Cumulative Prospect Theory Utility via Convex Optimization

Eric Luxenberg, Philipp Schiele, Stephen Boyd

AI总结:

研究在经验分布上最大化累积前景理论效用的投资组合优化问题,将CPT效用表示为两函数之差以推导全局下界,提出次函数最大化算法和凸-凹过程求解中小型复杂约束问题,并提供可扩展至大规模问题的简化方法。

摘要:

我们考虑在资产收益的经验分布上选择最大化累积前景理论(CPT)效用的投资组合问题。我们证明,虽然CPT效用不是投资组合权重的凹函数,但它可以表示为两个函数的差。第一项是凸函数与凹自变量的复合,第二项是凸函数与凸自变量的复合。这种结构允许我们在CPT效用上推导出一个全局下界,即次函数,我们可以在用于最大化CPT效用的次函数最大化(MM)算法中使用它。我们进一步证明,该问题适用于一种简单的凸-凹(CC)过程,该过程迭代地最大化局部近似。这两种方法都能处理中小型问题以及复杂(但凸的)投资组合约束。我们还描述了一种更简单的方法,它可以扩展到更大的问题,但仅处理简单的投资组合约束。

英文摘要:

We consider the problem of choosing a portfolio that maximizes the cumulative prospect theory (CPT) utility on an empirical distribution of asset returns. We show that while CPT utility is not a concave function of the portfolio weights, it can be expressed as a difference of two functions. The first term is the composition of a convex function with concave arguments and the second term a composition of a convex function with convex arguments. This structure allows us to derive a global lower bound, or minorant, on the CPT utility, which we can use in a minorization-maximization (MM) algorithm for maximizing CPT utility. We further show that the problem is amenable to a simple convex-concave (CC) procedure which iteratively maximizes a local approximation. Both of these methods can handle small and medium size problems, and complex (but convex) portfolio constraints. We also describe a simpler method that scales to larger problems, but handles only simple portfolio constraints.

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

↑