1 Introduction

The Value-at-Risk (VaR) is widely used in the financial industry as a downside risk measure. Since VaR does not take into account the magnitude of potential losses, the Conditional Value-at-Risk (CVaR), defined as the mean losses in excess of VaR, was proposed as a remedy and results usually in convex (linear) portfolio optimization problems (Rockafellar and Uryasev 2000, 2002). The purpose of the present work is to give an explicit solution to the optimal portfolio choice problem by minimizing the CVaR and VaR measures under distribution and mean return ambiguity when short positions are allowed. Distribution ambiguity is understood in the sense that no knowledge of the return distribution for risky assets is assumed while the mean and variance/covariance are assumed to be known. The optimal portfolio choice problem using the aforementioned risk measures under distribution ambiguity and allowing short positions was studied by Chen et al. (2011) in a recent paper in the case of n risky assets, extending the work of Zhu and Fukushima (2009) where the authors treat robust portfolio choice under distribution ambiguity. Chen et al. assumed that the mean return vector \(\mu\) and variance–covariance matrix \(\Upgamma\) of risky assets are known, and compute portfolios that are robust in the sense that they minimize the worst-case CVaR risk measure over all distributions with fixed first and second moment information. They obtained closed-form robust optimal portfolio rules. The reader is referred to El Ghaoui et al. (2003), Natarajan et al. (2010) and Popescu (2005) for other related studies on portfolio optimization with distributional robustness, and to Tong et al. (2010) for a computational study of scenario-based CVaR in portfolio optimization. A recent reference work on portfolio optimization (using the mean-variance approach as well as semi-variance and utility functions) in both single and multi-period frameworks is by Steinbach (2001). In particular, Natarajan et al. (2010) study expected utility models in portfolio optimization under distribution ambiguity using a piecewise-linear concave utility function. They obtain bounds on the worst-case expected utility, and compute optimal portfolios by solving conic programs. They also relate their bounds to convex risk measures by defining a worst-case Optimized-Certainty-Equivalent (OCE) risk measure. It is well known that one of the two risk measures used in the present paper, namely CVaR, can be obtained using the OCE approach for a class of utility functions; see Ben-Tal and Teboulle (2007). Thus the results of the present paper complement the previous work of Natarajan et al. (2010) by providing closed-form optimal portfolio rules for worst-case CVaR (and worst-case VaR) under both distribution and mean return ambiguity. In the present paper, we first extend, in Sect. 2, the results of Chen et al. to the case where a riskless asset is also included in the asset universe, a case which is usually an integral part of optimal portfolio choice theory. The inclusion of the riskless asset in the asset universe leads to extreme positions in the portfolio, which implies that the robust CVaR and VaR measures as given in the present paper have to be utilized with a minimum mean return constraint in the presence of a riskless asset to yield closed-form optimal portfolio rules. The distribution robust portfolios of Chen et al. (2011) are criticized in Delage and Ye (2010) for their sensitivity to uncertainties or estimation errors in the mean return data, a case that we refer to as Mean Return Ambiguity; see also Best and Grauer (1991a, b) and Black and Litterman (1992) for studies regarding sensitivity of optimal portfolios to estimation errors. To (partially) address this issue, we analyze in Sect. 3, the problem when the mean return is subject to ellipsoidal uncertainty (Ben-Tal and Nemirovski 1999, 1998; Garlappi et al. 2007; Goldfarb and Iyengar 2003; Ling and Xu 2012) in addition to distribution ambiguity, and derive a closed-form portfolio rule. The ellipsoidal uncertainty is regulated by a parameter that can be interpreted as a measure of confidence in the mean return estimate. In the presence of the riskless asset, a robust optimal portfolio rule under distribution and mean return ambiguity is obtained if the quantile parameter of CVaR or VaR measures is above a threshold depending on the optimal Sharpe ratio of the market and the confidence regulating parameter, or no such optimal rule exists (the problem is infeasible). The key to obtain optimal portfolio rules in the presence of a riskless under distribution and mean return ambiguity asset is again to include a minimum mean return constraint to trace the efficient robust CVaR (or robust VaR) frontier; Steinbach (2001). The incremental impact of adding robustness against mean return ambiguity in addition to distribution ambiguity is to alter the optimal Sharpe ratio of the market viewed by the investor. The investor views a smaller optimal Sharpe ratio decremented by the parameter reflecting the confidence of the investor in the mean return estimate.

In the case the riskless asset is not included in the portfolio problem, in Sect. 4, we derive in closed form the optimal portfolio choice robust against distribution and ellipsoidal mean return ambiguity without using a minimum mean return constraint, which generalizes a result of Chen et al. (2011) stated in the case of distribution ambiguity only, i.e., full confidence in the mean return estimate.

2 Minimizing robust CVaR and VaR in the presence of a riskless asset under distribution ambiguity

We work in a financial market with a riskless asset with return rate R in addition to n risky assets. We investigate robust solutions minimizing CVaR and VaR measures. The unit initial wealth is allocated into the riskless and risky assets so as to allow short positions, thus we can define the loss function as a function of the vector \({x \in \mathbb{R}^n}\) of allocations to n risky assets and the random vector ξ of return rates for these assets:

$$ f(x,\xi) = -(x^{\rm T}\xi + R(1- x^{\rm T}{e})), $$
(1)

where e denotes an n-vector of all ones. For the calculation of CVaR and VaR, we use the method in Rockafellar and Uryasev (2000), minimizing over γ the auxiliary function:

$$ F_\theta(x,\gamma) = \gamma + \frac{1}{1-\theta}{\mathbb{E}}[(f(x,\xi) - \gamma)_+], $$
(2)

i.e., the \(\theta\)-CVaR is calculated as follows:

$$ {\rm CVaR}_\theta(x) = \displaystyle \min_{\gamma \in {\mathbb{R}}} F_\theta(x,\gamma), $$
(3)

where \(\theta\) is the threshold probability level or the quantile parameter, which is generally taken to be in the interval [0.95,1). The convex set consisting of γ values that minimize F θ contains the θ-VaR, \({\rm VaR}_{\theta}(x), \) which is the minimum value in the set.

The worst-case CVaR, when \(\xi\) may assume a distribution from the set \({\mathbb{D} = \{\pi| \mathbb{E}_\pi[\xi]=\mu, \hbox{Cov}_\pi[\xi] = \Upgamma \succ 0\}}\) [i.e., the set of all distributions with (known and/or trusted) mean \(\mu\) and covariance \(\Upgamma\)], is defined as follows:

$$ {\rm RCVaR}_\theta(x) = \displaystyle \max_{\pi \in {\mathbb{D}}} {\rm CVaR}_\theta(x) $$
(4)
$$ = \displaystyle \max_{\pi \in {\mathbb{D}}} \min_{\gamma \in {\mathbb{R}}} F_\theta(x,\gamma). $$
(5)

For convenience, in the rest of the paper, we replace occurrences of the sup operator with max since in all cases we consider the sup is attained.

We assume μ is not a multiple of e, as usual. Let us define the excess mean return \(\tilde{\mu} = \mu - {Re}, \) and the highest attainable Sharpe ratio in the market \(H = \tilde{\mu}^{\rm T} \Upgamma^{-1} \tilde{\mu}; \) see Best (2010). The following Theorem Footnote 1 gives an explicit solution of the portfolio choice problem of minimizing worst-case CVaR under a minimum mean return constraint

$$ \min_{x \in {\mathbb{R}}^n: (\mu - {Re})^{\rm T}x \geq d-R} {\rm RCVaR}_\theta(x),$$
(6)

where \({d \in \mathbb{R}_+}\) is a minimum target mean return parameter. We assume the minimum mean target return is larger than the riskless return, i.e., d > R.

Theorem 1

For \( \theta \geq \frac{H}{H+1}, \) the problem Eq. (6) admits the optimal portfolio rule

$$ x^* = \frac{d-R}{H} \Upgamma^{-1} \tilde{\mu}. $$

For \(\theta < \frac{H}{H+1} , \) the problem Eq. (6) is unbounded.

Proof

Since the set of distributions \({\mathbb{D}}\) is convex and the function \({\gamma + \frac{1}{1-\theta}\mathbb{E}[(f(x,\xi) - \gamma)_+] }\) is convex in γ for every \(\xi,\) we can interchange supremum and minimum; see Theorem 2.4 of Shapiro (2011). More precisely, one considers first the problem \({\min_{\gamma \in \mathbb{R}} \max_{\pi \in \mathbb{D}} F_\theta(x,\gamma) }\) and one finds a unique optimal solution as we shall do below. Then, using convexity of \({\mathbb{D}}\) and the convexity of the function \({\gamma + \frac{1}{1-\theta}\mathbb{E}[(f(x,\xi) - \gamma)_+] }\) in γ one invokes Theorem 2.4 of Shapiro (2011) that allows interchange of min and max. We carry out this sequence of operations below:

$$ \displaystyle \min_{\gamma \in {\mathbb{R}}} \max_{\pi \in {\mathbb{D}}} F_\theta(x,\gamma) = \displaystyle \min_{\gamma \in {\mathbb{R}}} \gamma + \frac{1}{1-\theta} \max_{\pi \in {\mathbb{D}}} {{\mathbb{E}}[(-x^{\rm T}\xi - R + Rx^{\rm T} {e} - \gamma)_+]} $$
$$ = \displaystyle \min_{\gamma \in {\mathbb{R}}} \gamma + \frac{1}{1-\theta} \max_{\xi \sim (\mu,\Upgamma)} {{\mathbb{E}}[(- R - \gamma - x^{\rm T}(\xi -{Re} ))_+]} $$
(7)
$$ =\displaystyle \min_{\gamma \in {\mathbb{R}}} \gamma + \frac{1}{1-\theta} \max_{\eta \sim (\nu,\sigma^2)} {{\mathbb{E}}[(- R - \gamma - \eta)_+]} $$
(8)
$$ =\displaystyle \min_{\gamma \in {\mathbb{R}}} \gamma + \frac{1}{1-\theta} \frac{-R - \gamma - \nu + \sqrt{\sigma^2 + (-R-\gamma-\nu)^2}}{2}. $$
(9)

Maximum operators in Eqs. (7) and (8) are equivalent, since by a slight modification of Lemma 2.4 in Chen et al. (2011) we can state the equivalence of following sets of univariate random distributions:

$$ \begin{aligned} {\mathbb{D}}_1 =&\{x^{\rm T} (\xi - {Re}) : \xi \sim (\mu,\Upgamma ) \} \\ {\mathbb{D}}_2 =& \{ \eta: \eta \sim ( \nu , {\sigma}^2 ) \}, \end{aligned} $$

where \( \nu = x^{\rm T} (\mu - {Re} ), \) and \(\sigma^2 = x^{\rm T} \Upgamma x.\) Equality Eq. (9) follows by Lemma 2.2 of Chen et al. (2011). Then \({\rm RCVaR}_{\theta}(x)\) is the minimization of the following function over γ:

$$ h_x(\gamma) = \gamma + \frac{1}{1-\theta} \frac{-R - \gamma - \nu + \sqrt{\sigma^2 + (R+\gamma+\nu)^2}}{2}. $$

γ * x minimizing \(h_x(\gamma)\) can be found by equating the first derivative to zero:

$$ h'_x(\gamma) = 1 + \frac{1}{1-\theta} \frac{-1 + (R + \gamma + \nu) {(\sigma^2 + (R+\gamma+\nu)^2)}^{-\frac{1}{2}}}{2}. $$

Hence, we have

$$ 2\theta - 1 = (R + \gamma + \nu)/ \sqrt{\sigma^2 + (R+\gamma+\nu)^2}, $$

(recall that \(\theta > 0.5\) so that \(2 \theta-1 > 0\)) or, equivalently,

$$ (2\theta - 1)^2 (\sigma^2 + (R+\gamma+\nu)^2) = (R + \gamma + \nu)^2, $$

or,

$$ (2\theta - 1)^2 \sigma^2 = (R + \gamma + \nu)^2 (1-(2\theta-1)^2) $$

whence we obtain

$$ \begin{aligned} R + \gamma + \nu = & \frac{(2\theta-1)\sigma}{\sqrt{4\theta-4\theta^2}} \\ \gamma^*_x = & - R - \nu + \frac{(2\theta-1)\sigma}{2\sqrt{\theta}\sqrt{1-\theta}}, \cr \end{aligned} $$

since \(h_{x}(\gamma)\) is a convex function as is verified immediately using the second derivative test:

$$ h''_x(\gamma) = \frac{1}{2(1-\theta)} (\sigma^2 +(R+\gamma+\nu)^2)^{-\frac{3}{2}} \sigma^2 \quad \geq \quad 0 . $$

The minimum value of \(h_x(\gamma)\) being known, we can calculate the min max value:

$$ \begin{aligned} \min_{\gamma \in {\mathbb{R}}} \max_{\pi \in {\mathbb{D}}} F_\theta(x,\gamma) = & \min_{\gamma \in {\mathbb{R}}} h_x(\gamma) \\ = & \,h_x(\gamma^*_x) \\ = & -R - \nu + \frac{(2\theta-1)\sigma}{2\sqrt{\theta}\sqrt{1-\theta}} + \frac{1}{1-\theta} \frac{\frac{-(2\theta-1)\sigma}{2\sqrt{\theta}\sqrt{1-\theta}} + \sqrt{\sigma^2 + \frac{(2\theta-1)^2}{4\theta(1-\theta)}\sigma^2}}{2} \\ = & -R - \nu + \frac{\left(2\theta-1\right)\sigma}{2\sqrt{\theta}\sqrt{1-\theta}} + \frac{1}{1-\theta} \frac{\sigma}{2}\left(\frac{-2\theta + 1 + 1}{2\sqrt{\theta}\sqrt{1-\theta}}\right) \\ = & -R - \nu + \frac{(2\theta-1)\sigma}{2\sqrt{\theta}\sqrt{1-\theta}} + \frac{1}{1-\theta} \frac{\sigma(1-\theta)}{2\sqrt{\theta}\sqrt{1-\theta}}\\ = & -R - \nu + \frac{2\theta\sigma}{2\sqrt{\theta}\sqrt{1-\theta}}\\ = & -R - \nu + \frac{\sqrt{\theta}}{\sqrt{1-\theta}}\sigma \\ = & -R - (\mu -{Re})^{\rm T}x + \frac{\sqrt{\theta}}{\sqrt{1-\theta}}\sqrt{x^{\rm T}\Upgamma x}. \end{aligned} $$
(10)

Hence, by Theorem 2.4 of (Shapiro 2011) we have

$$ {\rm RCVaR}_\theta(x)=-R - (\mu - {Re})^{\rm T}x + \frac{\sqrt{\theta}}{\sqrt{1-\theta}}\sqrt{x^{\rm T}\Upgamma x}. $$

Minimizing the above expression for worst-case CVaR under the minimum mean return constraint, the robust optimal portfolio selection can be found Footnote 2.Using a non-negative multiplier λ, the Lagrange function is

$$ L(x,\lambda) = -R - (\mu - {Re})^{\rm T}x + \frac{\sqrt{\theta}}{\sqrt{1-\theta}}\sqrt{x^{\rm T}\Upgamma x} + \lambda(d-R -(\mu-{Re})^{\rm T} x). $$

The first-order conditions are:

$$ -\mu + {Re} + \frac{\kappa \Upgamma x}{\sqrt{x^{\rm T} \Upgamma x}} - \lambda(\mu-{Re}) = 0, $$

where we defined \(\kappa \equiv \frac{\sqrt{\theta}}{\sqrt{1-\theta}}\) for convenience. We make the supposition that x ≠ 0 and define \(\sigma\equiv \sqrt{x^{\rm T} \Upgamma x}. \) We get the candidate solution

$$ x_{\rm c} = \frac{\sigma(\lambda+1)}{\kappa}\Upgamma^{-1} \tilde{\mu}. $$

Now, using the identity \(x_{\rm c}^{{\rm T}} \Upgamma x_{\rm c} = \sigma^2,\) we obtain the equation

$$ (\lambda+1)^2 = \frac{\kappa^2}{H}, $$

which implies that \(\lambda = \frac{\kappa}{\sqrt{H}}-1. \) Under the condition \(\frac{\kappa}{\sqrt{H}} \geq 1\) we ensure λ ≥ 0. Now, utilizing the constraint which we assumed would be tight, the resulting equation yields (after substituting for x c and λ)

$$ \sigma = \frac{d-R}{\sqrt{H}}, $$

which is positive under the assumption d > R (H is positive by positive definiteness of \(\Upgamma\) and the assumption that μ is not a multiple of e). Now, substitute the above expressions for σ and λ into x c, and the desired expression is obtained after evident simplification. If \(\frac{\kappa}{\sqrt{H}} < 1\) then the problem Eq. (6) is unbounded by the convex duality theorem since it is always feasible.\(\square\)

The VaR measure can also be calculated using the auxiliary function Eq. (2):

$$ {\rm VaR}_{\theta}(x) = \arg \min_{\gamma \in {\mathbb{R}}} F_{\theta}(x,\gamma). $$

The worst-case VaR is now calculated as follows:

$$ \begin{aligned} {\rm RVaR}_\theta(x) = & \max_{\pi \in {\mathbb{D}}} {\rm VaR}_\theta(x)\\ = & \max_{\pi \in {\mathbb{D}}} \arg \min_{\gamma \in {\mathbb{R}}} F_{\theta}(x,\gamma)\\ = & \arg \min_{\gamma \in {\mathbb{R}}} \max_{\pi \in {\mathbb{D}}} F_\theta(x,\gamma)\\ = & \arg \min_{\gamma \in {\mathbb{R}}} h_x(\gamma)\\ = & \,\gamma^*_x. \end{aligned} $$

Again, a change of the order of operators makes this calculation possible by Theorem 2.4 of Shapiro (2011). With a similar approach to that followed for CVaR, we pose the problem of minimizing the robust VaR:

$$ \min_{x \in {\mathbb{R}}^n} - R - x^{\rm T} \mu + Rx^{\rm T} {e} + \frac{(2\theta-1)}{2\sqrt{\theta}\sqrt{1-\theta}} \sqrt{x^{\rm T}\Upgamma x} $$

subject to

$$ (\mu - {Re})^{\rm T}x \geq d-R. $$

We obtain a replica of the previous result in this case. Hence the proof, which is identical, is omitted.

Theorem 2

For \( \theta \geq \frac{1}{2} + \frac{1}{2} \frac{\sqrt{H}}{\sqrt{H+1}}, \) the problem of minimizing robust VaR under distribution ambiguity and a minimum mean return restriction admits the optimal portfolio rule

$$ x^{*} = \frac{d-R}{H} \Upgamma^{-1} \tilde{\mu}. $$

For \(\theta < \frac{1}{2} + \frac{1}{2} \frac{\sqrt{H}}{\sqrt{H+1}}, \) the problem is unbounded.

In both results stated above, the optimal portfolios are mean-variance efficient. We plot the critical thresholds for θ given in Theorems 1 and 2 in Fig. 1 below. Both thresholds tend to one as H goes to infinity and the threshold curve for robust VaR dominates that of robust CVaR. Hence, robust VaR leads to aggressive portfolio behavior in a larger interval for θ than robust CVaR. In other words, one has to choose a larger confidence level θ for robust VaR as compared to robust CVaR to make an optimal portfolio choice. Thus we can affirm that robust VaR is more conservative than robust CVaR.

Fig. 1
figure 1

The critical thresholds for robust CVaR and robust VaR. The upper curve is the threshold value curve for robust VaR

Based on the above results, it is straightforward to derive the equations of the robust CVaR efficient frontier and the robust VaR efficient frontier. Both robust frontiers are the straight lines governed by the equation

$$ d = \frac{\kappa}{\kappa-\sqrt{H}} R + \frac{\sqrt{H}}{\kappa-\sqrt{H}} f, $$
(11)

where for f = RCVaR and \(\kappa= \frac{\sqrt{\theta}}{\sqrt{1-\theta}}\) we obtain the efficient frontier for robust CVaR; and for f = RVaR and \(\kappa = \frac{(2\theta-1)}{2\sqrt{\theta}\sqrt{1-\theta}} \) we get the robust VaR efficient frontier.

3 Robust CVaR in the presence of riskless asset under distribution and mean return ambiguity

We consider now the problem of choosing a portfolio \({x \in \mathbb{R}^n}\) that minimizes the function

$$ {\rm RRCVaR}_\theta(x) = \displaystyle \max_{\pi \in {\mathbb{D}}, \bar{\mu} \in U_{\bar{\mu}}} {\rm CVaR}_\theta(x) $$
(12)

or equivalently

$$ {\rm RRCVaR}_\theta(x) =\max_{\bar{\mu} \in U_{\bar{\mu}} }\max_{\pi \in {\mathbb{D}}} \min_{\gamma \in {\mathbb{R}}} F_\theta(x,\gamma) $$
(13)

where we define the ellipsoidal uncertainty set \(U_{\bar{\mu}} = \{\bar{\mu}| \|\Upgamma^{-1/2}(\bar{\mu} - \mu^{{\rm nom}})\|_2 \leq \sqrt{\epsilon}\}\) for the mean return denoted \(\bar{\mu},\) where \(\mu^{\rm nom}\) denotes a nominal mean return vector which can be considered as the available estimate of mean return. The parameter \(\epsilon\) acts as a measure of confidence in the mean return estimate. We consider now the problem of choosing a portfolio \({x \in \mathbb{R}^n}\) that minimizes the function

$$ {\rm RRCVaR}_\theta(x) =\max_{\bar{\mu} \in U_{\bar{\mu}} }\max_{\pi \in {\mathbb{D}}} \min_{\gamma \in {\mathbb{R}}} F_\theta(x,\gamma) $$
(14)

subject to

$$ (\bar{\mu} - {Re})^{\rm T}x \geq d-R. $$

As in the previous section we define \({\mathbb{D} = \{\pi| \mathbb{E}_\pi[\xi]=\bar{\mu}, \hbox{Cov}_\pi[\xi] = \Upgamma \succ 0\}. }\) Considering the inner max min problem over \({\pi \in \mathbb{D}}\) and \({\gamma \in \mathbb{R}, }\) respectively, as in the proof of Theorem 1 of previous section while we keep \(\bar{\mu}\) fixed, we arrive at the inner problem for the objective function (recall Eq. 10) that we can transform immediately:

$$ \begin{aligned} \max_{\bar{\mu} \in U_{\bar{\mu}}} {\rm RCVaR}_\theta(x) = & \max_{\bar{\mu} \in U_{\bar{\mu}}} -R - (\bar{\mu} - {Re})^{\rm T}x + \frac{\sqrt{\theta}}{\sqrt{1-\theta}}\sqrt{x^{\rm T}\Upgamma x}\\ = &\max_{\bar{\mu} \in U_{\bar{\mu}}} -R - (\bar{\mu} - {Re})^{\rm T}x + \frac{\sqrt{\theta}}{\sqrt{1-\theta}}\sqrt{x^{\rm T}\Upgamma x} \\ = & -R - (\mu^*)^{\rm T} x + \sqrt{\epsilon} \sqrt{x^{\rm T} \Upgamma x} + \frac{\sqrt{\theta}}{\sqrt{1-\theta}}\sqrt{x^{\rm T}\Upgamma x}, \end{aligned} $$

where the last equality follows using a well-known transformation result in robust optimization (see e.g., Ben-Tal and Nemirovski 1999), and \(\mu^* = \mu^{{\rm nom}}-{Re}.\)

Using the same transformation on the minimum mean return constraint as well, we obtain the second-order conic problem

$$ \min_{x \in {\mathbb{R}}^n} -R - x^{\rm T} \mu^* + \left(\sqrt{\epsilon} + \frac{\sqrt{\theta}}{\sqrt{1-\theta}}\right)\sqrt{x^{\rm T}\Upgamma x} $$

subject to

$$ (\mu^{*})^{\rm T} x - \sqrt{\epsilon} \sqrt{x^{\rm T} \Upgamma x} \geq d-R, $$

where d > R.

Theorem 3

  1. 1.

    Under the Slater constraint qualification, if \(\theta > \frac{(\sqrt{H}- \sqrt{\epsilon})^2}{(\sqrt{H}- \sqrt{\epsilon})^2+1}, \) and \(\epsilon < H\) then the problem Eq. (14) admits the optimal portfolio rule

    $$ x^* = \frac{d-R}{(\sqrt{H}-\sqrt{\epsilon})\sqrt{H}} \Upgamma^{-1} \tilde{\mu}. $$
  2. 2.

    If \(\epsilon = H, \) the problem is unbounded.

  3. 3.

    If \(\epsilon > H, \) the problem is infeasible.

Proof

Under the Slater constraint qualification the Karush–Kuhn–Tucker optimality conditions are both necessary and sufficient. Using a non-negative multiplier λ we have the Lagrange function

$$ L(x,\lambda) = -R - x^{\rm T} \mu^* + \left(\sqrt{\epsilon} + \frac{\sqrt{\theta}}{\sqrt{1-\theta}}\right)\sqrt{x^{\rm T}\Upgamma x} + \lambda (d-R -(\mu^*)^{\rm T} x + \sqrt{\epsilon} \sqrt{x^{\rm T} \Upgamma x}). $$

Going through the usual steps as in the proof of Theorem 1 under the supposition that σ (defined as \(\sqrt{x^{\rm T} \Upsigma x}\)) is a finite non-zero positive number, we have the candidate solution:

$$ x_{\rm c} = \frac{\sigma (\lambda+1)}{\kappa + \sqrt{\epsilon}(\lambda+1)} \Upgamma^{-1} \mu^*. $$

From the identity \(x_{\rm c}^{\rm T} \Upgamma x_{\rm c} = \sigma^2\) we obtain the quadratic equation in λ:

$$ (H - \epsilon) \lambda^2 + (2 H - 2 \epsilon - 2 \sqrt{\epsilon} \kappa) \lambda + H - \epsilon - 2 \sqrt{\epsilon} \kappa - \kappa^2 = 0 $$

with the two roots

$$ -\frac{\kappa + \sqrt{H} + \sqrt{\epsilon}}{\sqrt{H} + \sqrt{\epsilon}}, -\frac{-\kappa + \sqrt{H} - \sqrt{\epsilon}}{\sqrt{H} - \sqrt{\epsilon}}. $$

The left root cannot be positive, so it is discarded. The right root is positive if \(H > \epsilon\) and \(\kappa \geq \sqrt{H} - \sqrt{\epsilon}. \) Now, returning to the conic constraint which is assumed to be tight we obtain an equation in σ after substituting for λ in the right root, and solving for σ using straightforward algebraic simplification we get

$$ \sigma = \frac{d-R}{\sqrt{H}-\sqrt{\epsilon}}, $$

which is positive provided \(H > \epsilon. \) Now, the expression for x * is obtained after substitution for σ and λ into x c and evident simplification.

Part 2 is immediate from the result of Part 1.

For part 3, if \(\epsilon \geq H, \) our hypothesis of a finite positive non-zero σ is false, in which case the only possible value for σ is zero, achieved at the zero risky portfolio which is infeasible.\(\square\)

The problem of minimizing the robust VaR under distribution and mean return ambiguity in the presence of a minimum target mean return constraint is posed as

$$ \min_{x \in {\mathbb{R}}^n} -R - x^{\rm T} \mu^* + \left(\sqrt{\epsilon} + \frac{\left(2\theta-1\right)}{2\sqrt{\theta}\sqrt{1-\theta}}\right) \sqrt{x^{\rm T}\Upgamma x} $$

subject to

$$ (\mu^*)^{\rm T} x - \sqrt{\epsilon} \sqrt{x^{\rm T} \Upgamma x} \geq d-R. $$

Again, we obtain a result similar to the previous theorem in this case. The proof is a verbatim repetition of the proof of the previous theorem, hence omitted.

Theorem 4

  1. 1.

    Under the Slater constraint qualification, if \(\theta > \frac{1}{2} +\frac{ \sqrt{H}-\sqrt{\epsilon}}{2 \sqrt{1+(\sqrt{H}-\sqrt{\epsilon})^2 }}, \) and \( \epsilon < H\) then the problem of minimizing the robust VaR under distribution and mean return ambiguity in the presence of a minimum target mean return constraint admits the optimal portfolio rule

    $$ x^* = \frac{d-R}{(\sqrt{H}-\sqrt{\epsilon})\sqrt{H}} \Upgamma^{-1} \tilde{\mu}. $$
  2. 2.

    If \(\epsilon = H, \) the problem is unbounded.

  3. 3.

    If \(\epsilon > H, \) the problem is infeasible.

Notice that we obtain identical and mean-variance efficient portfolio rules for both CVaR and VaR under distribution and mean return ambiguity. Furthermore, the optimal portfolio rules reduce to those of Theorems 1 and 2, respectively, for \(\epsilon=0, \) the case of distribution ambiguity only.

The robust CVaR and VaR efficient frontiers are straight lines given by the equation:

$$ d = \frac{\kappa}{\kappa-\sqrt{H} + \sqrt{\epsilon}} R + \frac{\sqrt{H}-\sqrt{\epsilon}}{\kappa-\sqrt{H}+\sqrt{\epsilon}} f, $$

where for f = RRCVaR and \(\kappa= \frac{\sqrt{\theta}}{\sqrt{1-\theta}}\) we obtain the efficient frontier for robust CVaR; and for f = RRVaR and \(\kappa = \frac{(2\theta-1)}{2\sqrt{\theta}\sqrt{1-\theta}} \) we get the robust VaR efficient frontier.

Comparing the above results and efficient frontier to the results of the previous section and to the efficient frontier Eq. (11) for the case of ambiguity distribution only, we notice that the effect of introducing mean return ambiguity in addition to distribution ambiguity has the effect of replacing \(\sqrt{H}\) by \(\sqrt{H}-\sqrt{\epsilon}. \) More precisely, the mean return ambiguity decreases the optimal Sharpe ratio of the market viewed by the investor. The investor can form an optimal portfolio in the risky assets as long as his/her confidence in the mean return vector is not too low, i.e., his \(\epsilon\) does not exceed the optimal Sharpe ratio of the market.

The efficient frontier line for the case of robust portfolios in the face of both distribution and mean return ambiguity is less steep than the efficient robust portfolios for distribution ambiguity only. This simple fact can be verified by direct computation:

$$ \frac{\sqrt{H}-\sqrt{\epsilon}}{\kappa-\sqrt{H}+\sqrt{\epsilon}} - \frac{\sqrt{H} }{\kappa-\sqrt{H} } = - \frac{\kappa \sqrt{\epsilon}}{(\kappa-\sqrt{H})(\kappa-\sqrt{H}+\sqrt{\epsilon})} < 0. $$

The d-intercept for the former is also smaller than for the latter as can be easily seen. We provide a numerical illustration in Fig. 2 with \(H=0.47222, \epsilon=0.4, R=1.01\) and θ = 0.95. The efficient portfolios robust to distribution ambiguity are represented by the steeper line. It is clear that the incremental effect of mean return ambiguity and robustness is to render the investor more risk averse and more cautious.

Fig. 2
figure 2

The efficient frontier lines for robust CVaR and robust VaR for \(H=0.47222, \epsilon=0.4, R=1.01\) and θ = 0.95. The steeper line corresponds to distribution ambiguity case while the point line corresponds to distribution and mean return ambiguity case

Fig. 3
figure 3

The behavior of robust CVaR as a function of \(\epsilon\) in the case without the riskless asset. The upper curve is for θ = 0.99 and the lower curve is for θ = 0.95

4 Without the riskless asset

We consider now the problems of the previous section as treated in Chen et al. (2011), i.e., without the riskless asset and without the minimum mean return constraint since we do not need this restriction to obtain an optimal portfolio rule. In that case we are dealing with the loss function:

$$ f(x,\xi ) = -x^{\rm T}\xi $$
(15)

and the auxiliary function

$$ F_\theta(x,\gamma) = \gamma + \frac{1}{1-\theta}{\mathbb{E}}[( -x^{\rm T}\xi - \gamma)_+]. $$
(16)

In Chen et al. (2011) Theorem 2.9 the authors solve the problem

$$ \min_{x \in {\mathbb{R}}^n: {e}^{\rm T} x = 1} \max_{\pi \in {\mathbb{D}}} {\rm CVaR}_\theta(x) $$

in closed form. We shall now attack the problem under the assumption that the mean returns are subject to errors that we confine to the ellipsoid: \(U_{\bar{\mu}} = \{\bar{\mu}| \|\Upgamma^{-1/2}(\bar{\mu} - \mu^{{nom}})\|_2 \leq \sqrt{\epsilon}\}\) for the mean return denoted \(\bar{\mu}, \) where μ nom denotes a nominal mean return vector as in the previous section. That is, we are interested in solving

$$ \min_{x \in {\mathbb{R}}^n: {e}^{\rm T} x = 1} \max_{\bar{\mu} \in U_{\bar{\mu}}} \max_{\pi \in {\mathbb{D}}} {\rm CVaR}_\theta(x). $$

Using partially the proof of Theorem 2.9 in Chen et al. (2011), and Theorem 2.4 of Shapiro (2011) as in the previous section, we have for arbitrary \(\bar{\mu}\)

$$ \max_{\pi \in {\mathbb{D}}} {\rm CVaR}_\theta(x) = \sqrt{\frac{\theta}{1-\theta}} \sqrt{x^{\rm T} \Upgamma x} - x^{\rm T} \bar{\mu}, $$

and the maximum is attained at

$$ \frac{2\theta-1}{2 \sqrt{\theta(1-\theta)}} \sqrt{x^{\rm T} \Upgamma x} - x^{\rm T} \bar{\mu} $$

which happens to be equal to the robust VaR under distribution ambiguity. Therefore, we obtain

$$ \max_{\bar{\mu} \in U_{\bar{\mu}}} \max_{\pi \in {\mathbb{D}}} {\rm CVaR}_\theta(x) = \sqrt{\frac{\theta}{1-\theta}} \sqrt{x^{\rm T} \Upgamma x} - x^{\rm T} \mu^{{\rm nom}} + \sqrt{\epsilon} \sqrt{x^{\rm T} \Upgamma x}. $$

Now, we are ready to process the problem

$$ \min_{x \in {\mathbb{R}}^n: {e}^{\rm T} x = 1} \sqrt{\frac{\theta}{1-\theta}} \sqrt{x^{\rm T} \Upgamma x} - x^{\rm T} \mu^{{\rm nom}} + \sqrt{\epsilon} \sqrt{x^{\rm T} \Upgamma x}. $$

From the first-order conditions we obtain

$$ x = \frac{\sigma}{\kappa + \sqrt{\epsilon}} \Upgamma^{-1} (\mu^{{\rm nom}} + \lambda {e}) $$

where \(\sigma \equiv (x^{\rm T} \Upgamma x)^{1/2}, \kappa = \sqrt{\theta/(1-\theta)}\) and λ is the Lagrange multiplier. Using the equation \(\sigma^2 = x^{\rm T} \Upgamma x\) we obtain the quadratic equation:

$$ C \lambda^2 + 2 B \lambda + A - (\kappa+\sqrt{\epsilon})^2 = 0 $$

where \(A = (\mu^{{\rm nom}})^{\rm T} \Upgamma^{-1} \mu^{{\rm nom}}, C = {e}^{\rm T} \Upgamma^{-1}{e}, B={e}^{\rm T} \Upgamma^{-1} \mu^{{\rm nom}}. \) We solve for λ under the condition

$$ C (\kappa + \sqrt{\epsilon})^2 > A C - B^2 $$

(note that A C − B 2 > 0 by Cauchy–Schwarz inequality):

$$ \lambda = \frac{-B + \sqrt{B^2 - A C + C (\kappa + \sqrt{\epsilon})^2}}{C}. $$

We discard the root \(\frac{-B - \sqrt{B^2 - A C + C (\kappa + \sqrt{\epsilon})^2}}{C} \) because it leads to a negative value for σ; see the expression for σ below. In this case, the dual problem is infeasible and the primal is unbounded since it cannot be infeasible. The condition \(C (\kappa + \sqrt{\epsilon})^2 > A C - B^2\) is equivalent to

$$ \epsilon >\left (\sqrt{A - B^2/C} - \sqrt{\theta/(1-\theta)}\right)^2, $$

[we do not allow \(\epsilon = (\sqrt{A - B^2/C} - \sqrt{\theta/(1-\theta)})^2\) since it results in a σ that grows without bound, hence the problem is unbounded]. Using the above expression for λ in the equation e T x = 1 we solve for σ to get

$$ \sigma = \frac{\kappa + \sqrt{\epsilon}}{\sqrt{B^2 - A C + C (\kappa + \sqrt{\epsilon})^2}}. $$

Substituting λ and σ to the expression for x obtained from the first-order conditions we obtain the solution

$$ x^* = \frac{1}{\sqrt{C (\kappa+ \sqrt{\epsilon})^2-\Updelta}} \Upgamma^{-1}\mu^{{\rm nom}} + \left[ -\frac{B}{C \sqrt{C (\kappa+ \sqrt{\epsilon})^2-\Updelta}} + \frac{1}{C}\right] \Upgamma^{-1}{e}, $$

where we have defined \(\Updelta = A C - B^2\) for simplicity. The portfolio problem for robust VaR under distribution and ellipsoidal mean return ambiguity is resolved similarly. In fact, the only change is in the definition of κ. Therefore, we have proved the following result.

Theorem 5

  1. 1.

    The distribution and mean return ambiguity robust CVaR portfolio choice, i.e., the solution to problem

    $$ \min_{x \in {\mathbb{R}}^n: {e}^{\rm T} x = 1} \max_{\bar{\mu} \in U_{\bar{\mu}}} \max_{\pi \in {\mathbb{D}}} {\rm CVaR}_\theta(x) $$

    is given by

    $$ x^* = \frac{1}{\sqrt{C (\kappa+ \sqrt{\epsilon})^2-\Updelta}} \Upgamma^{-1}\mu^{{\rm nom}} + \left[ -\frac{B}{C \sqrt{C (\kappa+ \sqrt{\epsilon})^2-\Updelta}} + \frac{1}{C}\right] \Upgamma^{-1} {e}, $$
    (17)

    where \(\Updelta = A C - B^2,\;A = (\mu^{{\rm nom}})^{\rm T} \Upgamma^{-1} \mu^{{\rm nom}}, \;C = {e}^{\rm T} \Upgamma^{-1}{e}, \;B={e}^{\rm T} \Upgamma^{-1} \mu^{{\rm nom}}, \) and \(\kappa = \sqrt{\theta/(1-\theta)}\) provided that \(\epsilon > (\sqrt{A - B^2/C} - \kappa)^2. \) If \(\epsilon \leq (\sqrt{A - B^2/C} - \kappa)^2 \) the problem is unbounded.

  2. 2.

    The distribution and mean return ambiguity robust VaR portfolio choice, i.e., the solution to problem

    $$ \min_{x \in {\mathbb{R}}^n: {e}^{\rm T} x = 1} \max_{\bar{\mu} \in U_{\bar{\mu}}} \frac{2\theta-1}{2 \sqrt{\theta(1-\theta)}} \sqrt{x^{\rm T} \Upgamma x} - x^{\rm T} \bar{\mu} $$

    is given by

    $$ x^* = \frac{1}{\sqrt{C (\kappa+ \sqrt{\epsilon})^2-\Updelta}} \Upgamma^{-1}\mu^{{\rm nom}} + \left[ -\frac{B}{C \sqrt{C (\kappa+ \sqrt{\epsilon})^2-\Updelta}} + \frac{1}{C}\right] \Upgamma^{-1} {e}. $$
    (18)

    where \(\Updelta = A C - B^2, \;A = (\mu^{{\rm nom}})^T \Upgamma^{-1} \mu^{{\rm nom}}, \;C = {e}^{\rm T} \Upgamma^{-1} {e}, \;B={e}^{\rm T} \Upgamma^{-1} \mu^{{\rm nom}}, \) and \(\kappa = \frac{2\theta-1}{2 \sqrt{\theta(1-\theta)}}\) provided that \(\epsilon > (\sqrt{A - B^2/C} - \kappa)^2. \) If \(\epsilon \leq (\sqrt{A - B^2/C} - \kappa)^2 \) the problem is unbounded.

Notice that the optimal portfolios are mean-variance efficient. Using the data in Chen et al. (2011) we plot the optimal CVaR function \(\sqrt{\frac{\theta}{1-\theta}} \sqrt{x^{\rm T} \Upgamma x} - x^{\rm T} \mu^{{\rm nom}} + \sqrt{\epsilon} \sqrt{x^{\rm T} \Upgamma x} \) evaluated at x * as a function of \(\epsilon\) in Fig. 3 for two different values of θ. As the confidence parameter \(\epsilon\) increases (i.e., confidence in the mean return estimate diminishes), the optimal robust CVaR increases, which implies an increase in risk (Fig. 3). A similar behavior occurs for robust VaR optimal value function. Interestingly the optimal robust CVaR and VaR increase for constant \(\epsilon\) when the quantile parameter θ increases (Fig. 3). When the uncertainty set \(U_{\bar{\mu}} \) is reduced to a single point μ nom = μ , i.e., for \(\epsilon = 0\) we obtain precisely the result of Chen et al. (2011), namely, Theorem 2.9:

Corollary 1

  1. 1.

    The distribution ambiguity robust CVaR portfolio choice, i.e., the solution to problem

    $$ \min_{x \in {\mathbb{R}}^n: {e}^{\rm T} x = 1} \max_{\pi \in {\mathbb{D}}} {\rm CVaR}_\theta(x) $$

    is given by

    $$ x^* = \frac{1}{\sqrt{C \kappa^2-\Updelta}} \Upgamma^{-1}\mu + \left[ -\frac{B}{C \sqrt{C \kappa^2-\Updelta}} + \frac{1}{C}\right] \Upgamma^{-1} {e}. $$
    (19)

    where \(\Updelta = A C - B^2, A = \mu^{\rm T} \Upgamma^{-1} \mu , C = {e}^{\rm T} \Upgamma^{-1} {e}, B={e}^{\rm T} \Upgamma^{-1} \mu ,\) and \(\kappa = \sqrt{\theta/(1-\theta)}\) provided that θ/(1 − θ) > A − B 2/C. If θ/(1 − θ) ≤ A − B 2/C the problem is unbounded.

  2. 2.

    The distribution ambiguity robust VaR portfolio choice, i.e., the solution to problem

    $$ \min_{x \in {\mathbb{R}}^n: {e}^{\rm T} x = 1} \frac{2\theta-1}{2 \sqrt{\theta(1-\theta)}} \sqrt{x^{\rm T} \Upgamma x} - x^{\rm T} \mu $$

    is given by

    $$ x^* = \frac{1}{\sqrt{C \kappa^2-\Updelta}} \Upgamma^{-1}\mu + \left[ -\frac{B}{C \sqrt{C \kappa^2-\Updelta}} + \frac{1}{C}\right] \Upgamma^{-1} {e}. $$
    (20)

    where \(\Updelta = A C - B^2, A = \mu^{\rm T} \Upgamma^{-1} \mu , C = {e}^{\rm T} \Upgamma^{-1} {e}, B={e}^{\rm T} \Upgamma^{-1} \mu,\) and \(\kappa = \frac{2\theta-1}{2 \sqrt{\theta(1-\theta)}} \) provided that \(\left(\frac{2\theta-1}{2 \sqrt{\theta(1-\theta)}}\right)^2 > A - B^2/C.\) If \(\left(\frac{2\theta-1}{2 \sqrt{\theta(1-\theta)}}\right)^2 \leq A - B^2/C \) the problem is unbounded.