Minimizing loss probability bounds for portfolio selection

In this paper, we derive a portfolio optimization model by minimizing upper and lower bounds of loss probability. These bounds are obtained under a nonparametric assumption of underlying return distribution by modifying the so-called generalization error bounds for the support vector machine, which has been developed in the field of statistical learning. Based on the bounds, two fractional programs are derived for constructing portfolios, where the numerator of the ratio in the objective includes the value-at-risk (VaR) or conditional value-at-risk (CVaR) while the denominator is any norm of portfolio vector. Depending on the parameter values in the model, the derived formulations can result in a nonconvex constrained optimization, and an algorithm for dealing with such a case is proposed. Some computational experiments are conducted on real stock market data, demonstrating that the CVaR-based fractional programming model outperforms the empirical probability minimization.     

An exact solution to a robust portfolio choice problem with multiple risk measures under ambiguous distribution

This paper proposes a unified framework to solve distributionally robust mean-risk optimization problem that simultaneously uses variance, value-at-risk (VaR) and conditional value-at-risk (CVaR) as a triple-risk measure. It provides investors with more flexibility to find portfolios in the sense that it allows investors to optimize a return-risk profile in the presence of estimation error. We derive a closed-form expression for the optimal portfolio strategy to the robust mean-multiple risk portfolio selection model under distribution and mean return ambiguity (RMP). Specially, the robust mean-variance, robust maximum return, robust minimum VaR and robust minimum CVaR efficient portfolios are all special instances of RMP portfolios. We analytically and numerically show that the resulting portfolio weight converges to the minimum variance portfolio when the level of ambiguity aversion is in a high value. Using numerical experiment with simulated data, we demonstrate that our robust portfolios under ambiguity are more stable over time than the non-robust portfolios.     

Robust portfolio choice with CVaR and VaR under distribution and mean return ambiguity

We consider the problem of optimal portfolio choice using the Conditional Value-at-Risk (CVaR) and Value-at-Risk (VaR) measures for a market consisting of n risky assets and a riskless asset and where short positions are allowed. When the distribution of returns of risky assets is unknown but the mean return vector and variance/covariance matrix of the risky assets are fixed, we derive the distributionally robust portfolio rules. Then, we address uncertainty (ambiguity) in the mean return vector in addition to distribution ambiguity, and derive the optimal portfolio rules when the uncertainty in the return vector is modeled via an ellipsoidal uncertainty set. In the presence of a riskless asset, the robust CVaR and VaR measures, coupled with a minimum mean return constraint, yield simple, mean-variance efficient optimal portfolio rules. In a market without the riskless asset, we obtain a closed-form portfolio rule that generalizes earlier results, without a minimum mean return restriction.     

CVaR鲁棒均值-CVaR投资组合模型与求解

传统的均值-风险(包括方差、VaR、CVaR等)组合选择模型在计算最优投资组合时,常假定均值是已知的常值,但在实际资产配置中,收益的均值估计会有偏差,即存在着估计风险.在利用CVaR测度估计风险的基础上,研究了CVaR鲁棒均值-CVaR投资组合选择模型,给出了另外两种不同的求解方法,即对偶法和光滑优化方法,并探讨了它们的相关性质及特征,数值实验表明在求解大样本或者大规模投资组合选择问题上,对偶法和光滑优化方法在计算上是可行且有效的.     

A robust approach based on conditional value-at-risk measure to statistical learning problems

In statistical learning problems, measurement errors in the observed data degrade the reliability of estimation. There exist several approaches to handle those uncertainties in observations. In this paper, we propose to use the conditional value-at-risk (CVaR) measure in order to depress influence of measurement errors, and investigate the relation between the resulting CVaR minimization problems and some existing approaches in the same framework. For the CVaR minimization problems which include the computation of integration, we apply Monte Carlo sampling method and obtain their approximate solutions. The approximation error bound and convergence property of the solution are proved by Vapnik and Chervonenkis theory. Numerical experiments show that the CVaR minimization problem can achieve fairly good estimation results, compared with several support vector machines, in the presence of measurement errors.     

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.     

Robust H ∞ Filtering for Uncertain Time-Delay Systems: Matrix Inequality Approach

In this paper, a new robust H _∞ filtering problem for uncertain time-delay systems is considered. Based on the Lyapunov method, a design criterion of the robust H _∞ filter, in which the filtering process remains asymptotically stable for all admissible uncertainties and the transfer function from the disturbance inputs to error state outputs satisfies the prespecified H _∞ norm upper bound constraint, is derived in terms of matrix inequalities. The inequalities can be solved easily by efficient convex optimization algorithms. A numerical example is included to illustrate the validity of the proposed design approach.     

Dynamic conditional value-at-risk model for routing and scheduling of hazardous material transportation networks

This paper illustrates a dynamic model of conditional value-at-risk (CVaR) measure for risk assessment and mitigation of hazardous material transportation in supply chain networks. The well-established market risk measure, CVaR, which is commonly used by financial institutions for portfolio optimizations, is investigated. In contrast to previous works, we consider CVaR as the main objective in the optimization of hazardous material (hazmat) transportation network. In addition to CVaR minimization and route planning of a supply chain network, the time scheduling of hazmat shipments is imposed and considered in the present study. Pertaining to the general dynamic risk model, we analyzed several scenarios involving a variety of hazmats and time schedules with respect to optimal route selection and CVaR minimization. A solution algorithm is then proposed for solving the model, with verifications made using numerical examples and sensitivity analysis.     

Robust asset allocation with conditional value at risk using the forward search

The well‐known Markowitz approach to portfolio allocation, based on expected returns and their covariance, seems to provide questionable results in financial management. One motivation for the pitfall is that financial returns have heavier than Gaussian tails, so the covariance of returns, used in the Markowitz model as a measure of portfolio risk, is likely to provide a loose quantification of the effective risk. Additionally, the Markowitz approach is very sensitive to small changes in either the expected returns or their correlation, often leading to irrelevant portfolio allocations. More recent allocation techniques are based on alternative risk measures, such as value at risk (VaR) and conditional VaR (CVaR), which are believed to be more accurate measures of risk for fat‐tailed distributions. Nevertheless, both VaR and CVaR estimates can be influenced by the presence of extreme returns. In this paper, we discuss sensitivity to the presence of extreme returns and outliers when optimizing the allocation, under the constraint of keeping CVaR to a minimum. A robust and efficient approach, based on the forward search, is suggested. A Monte Carlo simulation study shows the advantages of the proposed approach, which outperforms both robust and nonrobust alternatives under a variety of specifications. The performance of the method is also thoroughly evaluated with an application to a set of US stocks.     

Static and dynamic VaR constrained portfolios with application to delegated portfolio management

We give a closed-form solution to the single-period portfolio selection problem with a Value-at-Risk (VaR) constraint in the presence of a set of risky assets with multivariate normally distributed returns and the risk-less account, without short sales restrictions. The result allows to obtain a very simple, myopic dynamic portfolio policy in the multiple period version of the problem. We also consider mean-variance portfolios under a probabilistic chance (VaR) constraint and give an explicit solution. We use this solution to calculate explicitly the bonus of a portfolio manager to include a VaR constraint in his/her portfolio optimization, which we refer to as the price of a VaR constraint.     

A mixed 0–1 LP for index tracking problem with CVaR risk constraints

Index tracking problems are concerned in this paper. A CVaR risk constraint is introduced into general index tracking model to control the downside risk of tracking portfolios that consist of a subset of component stocks in given index. Resulting problem is a mixed 0?C1 and non-differentiable linear programming problem, and can be converted into a mixed 0?C1 linear program so that some existing optimization software such as CPLEX can be used to solve the problem. It is shown that adding the CVaR constraint will have no impact on the optimal tracking portfolio when the index has good (return increasing) performance, but can limit the downside risk of the optimal tracking portfolio when index has bad (return decreasing) performance. Numerical tests on Hang Seng index tracking and FTSE 100 index tracking show that the proposed index tracking model is effective in controlling the downside risk of the optimal tracking portfolio.     

CVaR norm and applications in optimization

This paper introduces the family of CVaR norms in \({\mathbb {R}}^{n}\) , based on the CVaR concept. The CVaR norm is defined in two variations: scaled and non-scaled. The well-known \(L_{1}\) and \(L_{\infty }\) norms are limiting cases of the new family of norms. The D-norm, used in robust optimization, is equivalent to the non-scaled CVaR norm. We present two relatively simple definitions of the CVaR norm: (i) as the average or the sum of some percentage of largest absolute values of components of vector; (ii) as an optimal solution of a CVaR minimization problem suggested by Rockafellar and Uryasev. CVaR norms are piece-wise linear functions on \({\mathbb {R}}^{n}\) and can be used in various applications where the Euclidean norm is typically used. To illustrate, in the computational experiments we consider the problem of projecting a point onto a polyhedral set. The CVaR norm allows formulating this problem as a convex or linear program for any level of conservativeness.     

The practice of Delta–Gamma VaR: Implementing the quadratic portfolio model

This paper intends to critically evaluate state-of-the-art methodologies for calculating the value-at-risk (VaR) of non-linear portfolios from the point of view of computational accuracy and efficiency. We focus on the quadratic portfolio model, also known as “Delta–Gamma”, and, as a working assumption, we model risk factor returns as multi-normal random variables. We present the main approaches to Delta–Gamma VaR weighing their merits and accuracy from an implementation-oriented standpoint. One of our main conclusions is that the Delta–Gamma-Normal VaR may be less accurate than even Delta VaR. On the other hand, we show that methods that essentially take into account the non-linearity (hence gammas and third or higher moments) of the portfolio values may present significant advantages over full Monte Carlo revaluations. The role of non-diagonal terms in the Gamma matrix as well as the sensitivity to correlation is considered both for accuracy and computational effort. We also qualitatively examine the robustness of Delta–Gamma methodologies by considering a highly non-quadratic portfolio value function.     

On Coherent Risk Measures Induced by Convex Risk Measures

We study the close relationship between coherent risk measures and convex risk measures. Inspired by the obtained results, we propose a class of coherent risk measures induced by convex risk measures. The robust representation and minimization problem of the induced coherent risk measure are investigated. A new coherent risk measure, the Entropic Conditional Value-at-Risk (ECVaR), is proposed as a special case. We show how to apply the induced coherent risk measure to realistic portfolio selection problems. Finally, by comparing its out-of-sample performance with that of CVaR, entropic risk measure, as well as entropic value-at-risk, we carry out a series of empirical tests to demonstrate the practicality and superiority of the ECVaR measure in optimal portfolio selection.     

Low order-value approach for solving VaR-constrained optimization problems

In Low Order-Value Optimization (LOVO) problems the sum of the r smallest values of a finite sequence of q functions is involved as the objective to be minimized or as a constraint. The latter case is considered in the present paper. Portfolio optimization problems with a constraint on the admissible Value at Risk (VaR) can be modeled in terms of a LOVO problem with constraints given by Low order-value functions. Different algorithms for practical solution of this problem will be presented. Using these techniques, portfolio optimization problems with transaction costs will be solved.     

改进的粒子群算法及在CVaR模型中的应用

为了求解带有条件风险价值(CVaR)约束的均值-方差模型,提出一种基于广义学习和柯西变异的粒子群算法(CCPSO).在CCPSO算法中,为了提升种群跳出局部最优解的能力,引入一种广义学习策略,提升粒子向最优解飞行的概率;并引入一种动态变异概率,对粒子自身最优位置进行柯西变异,更好地引导种群的飞行;最后,根据全局最优粒子的运行状况,每间隔若干代对其进行变异,以产生全局新的领导者.在基准函数测试中,结果显示CCPSO算法有较好的运行结果.在CVaR模型投资组合优化中,与其它算法相比,CCPSO算法所获结果是有效的,并且优于其它算法.     

Recent Developments in Robust Portfolios with a Worst-Case Approach

Robust models have a major role in portfolio optimization for resolving the sensitivity issue of the classical mean–variance model. In this paper, we survey developments of worst-case optimization while focusing on approaches for constructing robust portfolios. In addition to the robust formulations for the Markowitz model, we review work on deriving robust counterparts for value-at-risk and conditional value-at-risk problems as well as methods for combining uncertainty in factor models. Recent findings on properties of robust portfolios are introduced, and we conclude by presenting our thoughts on future research directions.     

Integrated simulation and optimization models for tracking international fixed income indices

Portfolio managers in the international fixed income markets must address jointly the interest rate risk in each market and the exchange rate volatility across markets. This paper develops integrated simulation and optimization models that address these issues in a common framework. Monte Carlo simulation procedures generate jointly scenarios of interest and exchange rates and, thereby, scenarios of holding period returns of the available securities. The portfolio manager’s risk tolerance is incorporated either through a utility function or a (modified) mean absolute deviation function. The optimization models prescribe asset allocation weights among the different markets and also resolve bond-picking decisions. Therefore several interrelated decisions are cast in a common framework. Two models – an expected utility maximization and a mean absolute deviation minimization – are implemented and tested empirically in tracking a composite index of the international bond markets. Backtesting over the period January 1997 to July 1998 illustrate the efficacy of the optimization models in dealing with uncertainty and tracking effectively the volatile index. Of particular interest is the empirical demostration that the integrative models generate portfolios that dominate the portfolios obtained using classical disintegrated approaches. Received: November 24, 1998 / Accepted: October 1, 2000?Published online December 15, 2000     

A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure

This paper is concerned with solving single CVaR and mixed CVaR minimization problems. A CHKS-type smoothing sample average approximation (SAA) method is proposed for solving these two problems, which retains the convexity and smoothness of the original problem and is easy to implement. For any fixed smoothing constant ε, this method produces a sequence whose cluster points are weak stationary points of the CVaR optimization problems with probability one. This framework of combining smoothing technique and SAA scheme can be extended to other smoothing functions as well. Practical numerical examples arising from logistics management are presented to show the usefulness of this method.     

Credit risk optimization with Conditional Value-at-Risk criterion

This paper examines a new approach for credit risk optimization. The model is based on the Conditional Value-at-Risk (CVaR) risk measure, the expected loss exceeding Value-at-Risk. CVaR is also known as Mean Excess, Mean Shortfall, or Tail VaR. This model can simultaneously adjust all positions in a portfolio of financial instruments in order to minimize CVaR subject to trading and return constraints. The credit risk distribution is generated by Monte Carlo simulations and the optimization problem is solved effectively by linear programming. The algorithm is very efficient; it can handle hundreds of instruments and thousands of scenarios in reasonable computer time. The approach is demonstrated with a portfolio of emerging market bonds. Received: November 1, 1999 / Accepted: October 1, 2000?Published online December 15, 2000