Warning: preg_replace(): The /e modifier is no longer supported, use preg_replace_callback instead in /home/phme2432/public_html/wp-content/plugins/latex/latex.php on line 47
The aim is the optimization either by maximizing total return (or minimizing risk), in keeping with the constraints of normalization for a given risk (or return).
Thus Lagrange method is perfectly suited for the job.
For minimizing risk, respect to a desired total return , one must consider the function of total risk
and minimize the lagrangian with constrain over the desired return and sum to one of weights.
Thus, provided that the constraints have non-zero derivatives,
by the fact that is a non--degenerate constant vector (otherwise fixing the Total Risk is given), the Lagrangian is given by
with the vector of lagrange multipliers.
Thus the minimization (maximization) is given by finding the extremant of the Lagrangian,
That is solved by considering the following linear system, that considering a symmetric covariance matrix is given by
where and in the definition of the matrix are linear vectors of equal dimension.
Finally considering the Hessian for operator to find the convexity.
Analogously could be done for a maximum return portfolio or relaxing the attribute for the desired best compromise.