Take the 2-minute tour ×
Quantitative Finance Stack Exchange is a question and answer site for finance professionals and academics. It's 100% free, no registration required.

In portfolio management one often has to solve problems of the quadratic form $$ w^T \Sigma w + w^T c \rightarrow Min $$ with portfolio weights $w \in \mathbb{R}^N$ a constant $c \in \mathbb{R}^N$ and a covariance matrix $\Sigma \in \mathbb{R}^{N \times N}$. Furthermore we assume real world continuous and binary (e.g. cardinality) constraints.

For estimating the covariance matrix $\Sigma$ we can e.g. use the sample covariance of the returns of all assets - let's call this an asset-by-asset model. It is known that some care has to be taken here if $N$ is big and so forth, but this is not the point of this question.

On the other hand we can define factors $(F_k)_{k=1}^K$ with $K<N$. These factors have a covariance matrix $\Sigma_F \in \mathbb{R}^{K \times K}$. Each return can be written as $$ r_i = \sum_{k=1}^K e_{i,k} F_k + \epsilon_i, $$ with the meaning that the variation of the return is described by the exposures $e_{i,k}$ to the factors and some purely idiosyncratic risk $\epsilon$. In this case the covariance matrix of returns is given by $$ \hat{\Sigma} = e \Sigma_F e^T + \mathop{diag}(Var[\epsilon_1],\ldots,Var[\epsilon_N]), $$ where $e \in \mathbb{R}^{N \times K}$ is the matrix of all exposures and the "diag" part adds the idiosyncratic parts of variance at the main diagonal. Note that $\hat{\Sigma} \in \mathbb{R}^{N \times N}$.

I sometimes read that a problem with covariance matrix $\hat{\Sigma}$ from the factor model is easier to solve than with $\Sigma$. Is this true? If yes, then how can we see this? My personal answer so far is: no. Because both are $N \times N$ matrices and the structure does not help in general.

Especially if the factors are not orthogonal - what do we gain? If the factors come from a PCA then we might gain something but I wonder how many PCs we would need e.g. in a global equities portfolio ...

share|improve this question
    
In fact @DavidNehme has already answered this question when he answered this one: quant.stackexchange.com/questions/9616/… –  Richard Dec 12 '13 at 13:01
    
But the non-orthonogal case is still not clear to me. –  Richard Dec 12 '13 at 14:30
    
I'm not so sure that I've read that portfolio optimization on $\widehat{\Sigma}$ is "easier" than the optimization on $\Sigma$. You're still working with an $N\times N$ matrix, but you've ensured that it is positive definite (which is a good thing). You could always generate some random data and test the idea. It might be possible to set up the optimization in terms of principal portfolios so you're only operating on the first few $K$ principal portfolios and then translating those weights back into normal weights for constraints and TC. –  John Dec 12 '13 at 21:58
    
However, if the weight constraints are too restrictive, then it might not work as you'd like. –  John Dec 12 '13 at 21:59

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.