基于CVaR投资组合优化问题的光滑化方法

对选定的风险资产进行组合投资,以条件风险价值(CVaR)作为度量风险的工具,建立单期投资组合优化问题的CVaR模型。目标函数中含有多重积分与plus函数,产生情景矩阵将多重积分计算转化成求和运算,提出plus函数的一个新的一致光滑逼近函数并给出求解CVaR模型的光滑化方法,最后的实证研究表明了本文算法的优越性。     

基于CVaR的债券投资组合模型

针对债券投资组合中的风险度量难题,用CVaR作为风险度量方法,构建了基于CVaR的债券投资组合优化模型.采用历史模拟算法处理模型中的随机收益率向量,将随机优化模型转化为确定性优化模型,并且证明了算法的收敛性.通过线性化技术处理CVaR中的非光滑函数,将该模型转化为一般的线性规划模型.结合10只债券的组合投资实例,验证了模型与算法的有效性.     

求解带有交易费的CVaR投资组合模型的L-S算法

本文假设投资者是风险厌恶型,用CVaR作为测量投资组合风险的方法.在预算约束的条件下,以最小化CVaR为目标函数,建立了带有交易费用的投资组合模型.将模型转化为两阶段补偿随机优化模型,构造了求解模型的随机L-S算法.为了验证算法的有效性,用中国证券市场中的股票进行数值试验,得到了最优投资组合、VaR和CVaR的值.而且对比分析了有交易费和没有交易费的最优投资组合的不同,给出了相应的有效前沿.     

基于多目标CVaR模型的证券组合投资的风险度量和策略

本文首先定义了多损失函数下的-αVaR,-αCVaR损失值以及-αCVaR损失值的等价函数,给出了多目标CVaR模型.然后,基于多目标CVaR模型,建立了一个多目标证券组合投资优化模型,得出在多置信水平下的证券组合投资比例和CVaR值,据此建立一种证券组合投资的降低风险优化模型.其降低风险策略是在收益率不变的情形下降低风险和总投资比例.数值实验表明,这种策略是可以通过明显地减少总投资比例来达到降低风险的目的.     

含MCVaR的投资组合优化统一模型

研究了Duarte提出的投资组合优化统一模型及条件风险价值(CVaR),分析了以CVaR为风险度量的投资组合优化模型的具体形式,建立了统一七种模型的投资组合优化统一模型,并发现统一模型是一个凸二次规划问题.     

基于相对鲁棒CVaR的电网投资项目组合优化模型研究

在新一轮电改的背景下,电网投资将面临更多的不确定性风险,亟需落实精准投资以降低投资风险.将相对鲁棒CVaR风险度量模型应用于电网投资项目组合优化中,构建了基于相对鲁棒CVaR的电网投资项目组合优化模型,并通过蒙特卡洛仿真和K-means聚类方法进行随机样本的生成与削减.算例结果表明,相对鲁棒CVaR模型具有极好的鲁棒性,能够在相对最坏情景下保证电网投资风险的最小化;同时,相对于绝对鲁棒CVaR模型减小了决策结果的保守性.     

基于CVaR衍生的多期多面风险度量下的投资组合研究

为了解决多期投资组合的决策问题,本文将由CVaR衍生的多期多面风险度量作为风险控制目标,建立了一个在收益约束条件下最小化风险的多阶段投资组合模型。为求解模型,设计了多期投资组合优化流程,它将非参数抽样方法、基于聚类算法的多阶段情景树生成方法和多期多面风险度量组合在一起。该流程基于计算、容易实现、直观合理。根据我国金融市场数据进行的实证研究结果表明,这一流程具有较好的实用性。     

一种高阶牛顿法求解投资组合优化模型

建立了均值方差投资组合优化模型.通过把凸二次规划转化为非光滑的非线性方程组,并对其光滑化处理,进而转化为光滑非线性方程组,再用高阶牛顿法进行求解.最后应用于投资组合优化模型,通过改变年收益率而得到不同的投资决策.该算法计算速度快,效率高,因此算法具有较广泛的应用空间.     

基于CVaR的最优投资组合模型算法分析

通过引入光滑因子,改进了基于条件风险值(CVaR)的最优投资组合线性模型,并详细介绍了以VaR最小为目标函数的最优投资组合模型的算法设计思想与过程.     

基于动态损失厌恶投资组合优化模型及实证研究

为了研究行为金融学中损失厌恶的心理特征对投资决策的影响,建立预期效用最大化的动态损失厌恶投资组合优化模型。以我国股票市场为依托进行实证研究,将市场分为上升、下降和盘整三种状态,研究动态损失厌恶投资组合模型的表现,与静态损失厌恶投资组合模型、均值-方差投资组合模型和CVaR投资组合模型进行比较。通过改变参照点对动态模型进行稳健性检验。得出动态损失厌恶投资组合模型优于静态模型、均值-方差投资组合模型和CVaR投资组合模型的结论。     

On solving the dual for portfolio selection by optimizing Conditional Value at Risk

This note is focused on computational efficiency of the portfolio selection models based on the Conditional Value at Risk (CVaR) risk measure. The CVaR measure represents the mean shortfall at a specified confidence level and its optimization may be expressed with a Linear Programming (LP) model. The corresponding portfolio selection models can be solved with general purpose LP solvers. However, in the case of more advanced simulation models employed for scenario generation one may get several thousands of scenarios. This may lead to the LP model with huge number of variables and constraints thus decreasing the computational efficiency of the model. To overcome this difficulty some alternative solution approaches are explored employing cutting planes or nondifferential optimization techniques among others. Without questioning importance and quality of the introduced methods we demonstrate much better performances of the simplex method when applied to appropriately rebuilt CVaR models taking advantages of the LP duality.     

Conditional value-at-risk in portfolio optimization: Coherent but fragile

We evaluate conditional value-at-risk (CVaR) as a risk measure in data-driven portfolio optimization. We show that portfolios obtained by solving mean-CVaR and global minimum CVaR problems are unreliable due to estimation errors of CVaR and/or the mean, which are magnified by optimization. This problem is exacerbated when the tail of the return distribution is made heavier. We conclude that CVaR, a coherent risk measure, is fragile in portfolio optimization due to estimation errors.     

基于神经网络分位数回归的多期CVaR风险测度

与VaR金融风险测度相比,CVaR具有更好的数理性质,其计算方法成为关注的焦点。相对于单期CVaR而言,多期CVaR风险测度具有较强的非线性特征,其建模过程更加复杂。在神经网络分位数回归基础上,建立了一种新的多期CVaR风险测度方法;基于似然比检验,建立了多期CVaR风险测度返回测试评价准则。将该新方法应用于沪深300指数的多期CVaR风险测度,并将其与传统的测度方法进行了对比,返回测试结果表明:第一,该新方法具有较强的稳健性,各期平均绝对误差大小基本不变,特别适合于多期CVaR风险测度;第二,基于神经网络分位数回归的多期CVaR风险测度效果优于传统测度方法,表现为似然比检验拒绝次数最少和平均绝对误差最小。     

Conditional value at risk and related linear programming models for portfolio optimization

Many risk measures have been recently introduced which (for discrete random variables) result in Linear Programs (LP). While some LP computable risk measures may be viewed as approximations to the variance (e.g., the mean absolute deviation or the Gini’s mean absolute difference), shortfall or quantile risk measures are recently gaining more popularity in various financial applications. In this paper we study LP solvable portfolio optimization models based on extensions of the Conditional Value at Risk (CVaR) measure. The models use multiple CVaR measures thus allowing for more detailed risk aversion modeling. We study both the theoretical properties of the models and their performance on real-life data.     

基于CVaR方法的房地产组合投资最优化模型研究

房地产开发项目投资是具有高风险高回报的典型的风险投资.在这个高风险的投资环境中要想达到预期目标,就必须对整个项目进行开发投资风险分析.本文运用CVaR对房地产项目投资存在的风险进行识别度量,通过建立基于CVaR下的房地产组合投资模型,达到项目风险防范的目的,提高投资回报的稳定性.     

Penalized sample average approximation methods for stochastic programs in economic and secure dispatch of a power system

In this paper, we develop a stochastic programming model for economic dispatch of a power system with operational reliability and risk control constraints. By defining a severity-index function, we propose to use conditional value-at-risk (CVaR) for measuring the reliability and risk control of the system. The economic dispatch is subsequently formulated as a stochastic program with CVaR constraint. To solve the stochastic optimization model, we propose a penalized sample average approximation (SAA) scheme which incorporates specific features of smoothing technique and level function method. Under some moderate conditions, we demonstrate that with probability approaching to 1 at an exponential rate with the increase of sample size, the optimal solution of the smoothing SAA problem converges to its true counterpart. Numerical tests have been carried out for a standard IEEE-30 DC power system.     

Robust portfolio optimization with copulas

Conditional Value at Risk (CVaR) is widely used in portfolio optimization as a measure of risk. CVaR is clearly dependent on the underlying probability distribution of the portfolio. We show how copulas can be introduced to any problem that involves distributions and how they can provide solutions for the modeling of the portfolio. We use this to provide the copula formulation of the CVaR of a portfolio. Given the critical dependence of CVaR on the underlying distribution, we use a robust framework to extend our approach to Worst Case CVaR (WCVaR). WCVaR is achieved through the use of rival copulas. These rival copulas have the advantage of exploiting a variety of dependence structures, symmetric and not. We compare our model against two other models, Gaussian CVaR and Worst Case Markowitz. Our empirical analysis shows that WCVaR can asses the risk more adequately than the two competitive models during periods of crisis.     

A smoothing method for solving portfolio optimization with CVaR and applications in allocation of generation asset

This paper focuses on the computation issue of portfolio optimization with scenario-based CVaR. According to the semismoothness of the studied models, a smoothing technology is considered, and a smoothing SQP algorithm then is presented. The global convergence of the algorithm is established. Numerical examples arising from the allocation of generation assets in power markets are done. The computation efficiency between the proposed method and the linear programming (LP) method is compared. Numerical results show that the performance of the new approach is very good. The remarkable characteristic of the new method is threefold. First, the dimension of smoothing models for portfolio optimization with scenario-based CVaR is low and is independent of the number of samples. Second, the smoothing models retain the convexity of original portfolio optimization problems. Third, the complicated smoothing model that maximizes the profit under the CVaR constraint can be reduced to an ordinary optimization model equivalently. All of these show the advantage of the new method to improve the computation efficiency for solving portfolio optimization problems with CVaR measure.