Skip to content
All library documents

Relating Standard-Deviation and Variance Mean-Variance Objectives

Article Quant Q&A · Author: ethor

Summary

The document compares two portfolio optimization objectives: expected return penalized by variance, and expected return penalized by standard deviation. It derives a parameter mapping, δ = η divided by the portfolio’s standard deviation, that makes their gradients agree at a solution of the standard-deviation problem. This gives an interpretation for how the risk-aversion parameters relate at that portfolio: the mapping depends on both η and the resulting portfolio risk.

The argument is a first-order calculation, not a general proof that the two constrained optimization problems have the same global optimum. The stated objectives include equality and inequality constraints, whose optimality conditions also involve constraint multipliers; the derivation omits them. It also assumes differentiability and a nonzero portfolio standard deviation, and its critical-point equations do not generally hold for constrained optima. Thus the conversion is best understood as a local relationship under suitable conditions, rather than a universal equivalence. The document provides no numerical example or empirical evidence.

Key ideas

  • The variance-penalized objective has gradient equal to expected returns minus δ times the covariance matrix applied to portfolio weights.
  • The standard-deviation-penalized objective has a risk term scaled by portfolio volatility.
  • Matching the two gradients at a candidate solution gives δ as η divided by that portfolio’s standard deviation.
  • The parameter conversion depends on the portfolio selected by the standard-deviation objective.
  • Constraints and global optimality require additional analysis beyond the unconstrained first-order argument.

Tags

Full text
# Alternative form of mean-variance optimization that uses standard deviation


# Alternative form of mean-variance optimization that uses standard deviation












I'm curious about an exercise found in Optimization Methods in Finance. Exercise 8.2 (pg 143) explores a variant of the more commonly used form of MVO. When I refer to the more common variant I'm talking about:

$$ \begin{aligned} \operatorname{max}_x \mu^Tx - \frac{\delta}{2}x^T\Sigma x & \\ Ax &= b \\ Cx &\ge d \end{aligned} $$

The variant that directly uses standard deviation by taking the square root of $x^T\Sigma x$ is:

$$ \begin{aligned} \operatorname{max}_x \mu^Tx - \eta \sqrt{x^T\Sigma x} & \\ Ax &= b \\ Cx &\ge d \end{aligned} $$

The exercise at hand is stated in the book as:

> For each $\eta$, let $x^*(\eta)$ denote the optimal solution of the second form. Show that there exists a $\delta > 0$ such that $x^*(n)$ solves the first form for that $\delta$.

I'm interested in making this conversion because of the more intuitive interpretation of subtracting $\eta$ standard deviations from the mean (which are denominated in the same units), versus subtracting the variance (which doesn't have as clear cut of an interpretation for me).

Seems somewhat similar to the currently unanswered question The Viability/Usefulness of Mean Standard Deviation Optimization?.

## Answer by ethor (score 0)

https://quant.stackexchange.com/a/74569

I've been trying to answer my own question, and this is what I have so far. It should be a good starting point for a discussion.

First, fix $\eta$ and take the gradients of each of the objective functions. If we denote the first objective function as $f_\delta(x)$, then

\begin{aligned} \nabla f_\delta(x) &= \mu - \frac{\delta}{2}\left(2\Sigma x\right) = \mu - \delta\Sigma x \end{aligned}

And if we denote the second objective function as $g(x)$, then

\begin{aligned} \nabla g(x) &= \mu - \frac{\eta\Sigma x}{\sqrt{x^T\Sigma x}} \end{aligned}

We know that $x^*(\eta)$ is a critical point, so $\nabla g(x^*(\eta)) = 0$ holds.

\begin{aligned} \nabla g(x^*(\eta)) &= \mu - \frac{\eta\Sigma x^*(\eta)}{\sqrt{x^*(\eta)^T\Sigma x^*(\eta)}} = 0 \\ \frac{\eta\Sigma x^*(\eta)}{\sqrt{x^*(\eta)^T\Sigma x^*(\eta)}} &= \mu \\ x^*(\eta) &= \frac{\Sigma^{-1}\mu\sqrt{x^*(\eta)^T\Sigma x^*(\eta)}}{\eta} \end{aligned}

We also know that a solution for the first problem, call it $y$, must satisfy $\nabla f_\delta(y) = 0$.

\begin{align} \nabla f_\delta(y) &= \mu -\delta\Sigma y = 0 \\ \delta\Sigma y &= \mu \\ y &= \frac{\Sigma^{-1}\mu}{\delta} \end{align}

Now, we want to find some $\delta^*$ so that $y = x^*(\eta)$.

\begin{align} \frac{\Sigma^{-1}\mu}{\delta^*} &= \frac{\Sigma^{-1}\mu\sqrt{x^*(\eta)^T\Sigma x^*(\eta)}}{\eta} \\ \frac{1}{\delta^*} &= \frac{\sqrt{x^*(\eta)^T\Sigma x^*(\eta)}}{\eta} \\ \delta^* &= \frac{\eta}{\sqrt{x^*(\eta)^T\Sigma x^*(\eta)}} \end{align}

Just to be sure, we can double check that $x^*(\eta)$ is a critical point of $f_{\delta^*}(x)$.

\begin{align} \nabla f_{\delta^*}(x^*(\eta)) &= \mu - \frac{\eta\Sigma x^*(\eta)}{\sqrt{x^*(\eta)^T\Sigma x^*(\eta)}} = \nabla g(x^*(\eta)) = 0 \end{align}

My takeaways from $\delta^*$ are:

- $\delta^* \propto \eta$. $\eta$ chooses how many standard deviations below the mean we should maximize, so the bigger $\eta$ is, the more risk-averse we are. Similarly, higher $\delta$ chooses the ratio of extra returns we need to be willing to accept additional risk. These explanations agree with each other.

- $\delta^* \propto \frac{1}{\sqrt{x^*(\eta)^T\Sigma x^*(\eta)}}$. The term in the denominator is the standard deviation for the optimal solution to the alternative form of the MVO problem. The bigger this standard deviation is, the more risk-seeking we are.

Shown in full with attribution under the source's licence. Licence: CC BY-SA 4.0 (Stack Exchange)

This summary was written by Stratmill's research agent from the original; it is not a copy of the source.