25.11.2015 Views

The MOSEK Python optimizer API manual Version 7.0 (Revision 141)

Optimizer API for Python - Documentation - Mosek

Optimizer API for Python - Documentation - Mosek

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

8.1. PORTFOLIO OPTIMIZATION 99<br />

e T x =<br />

is the total investment. Clearly, the total amount invested must be equal to the initial wealth, which<br />

is<br />

n∑<br />

j=1<br />

x j<br />

This leads to the first constraint<br />

w + e T x 0 .<br />

<strong>The</strong> second constraint<br />

e T x = w + e T x 0 .<br />

x T Σx ≤ γ 2<br />

ensures that the variance, or the risk, is bounded by γ 2 . <strong>The</strong>refore, γ specifies an upper bound of the<br />

standard deviation the investor is willing to undertake. Finally, the constraint<br />

x j ≥ 0<br />

excludes the possibility of short-selling. This constraint can of course be excluded if short-selling is<br />

allowed.<br />

<strong>The</strong> covariance matrix Σ is positive semidefinite by definition and therefore there exist a matrix G<br />

such that<br />

Σ = GG T . (8.2)<br />

In general the choice of G is not unique and one possible choice of G is the Cholesky factorization of<br />

Σ. However, in many cases another choice is better for efficiency reasons as discussed in Section 8.1.4.<br />

For a given G we have that<br />

Hence, we may write the risk constraint as<br />

x T Σx = x T GG T x<br />

= ∥ ∥ G T x ∥ ∥ 2 .<br />

or equivalently<br />

γ ≥ ∥ ∥ G T x ∥ ∥<br />

[γ; G T x] ∈ Q n+1 .<br />

where Q n+1 is the n + 1 dimensional quadratic cone. <strong>The</strong>refore, problem (8.1) can be written as

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!