Portfolio Optimization, Quantitative Finance, Python Programming, Convex Optimization, Data Science.
be greater than or equal to 0. It is a long-only portfolio. The domain of w is a half-space which is a convex set. Problem 2: Minimizing the portfolio variance aka the risk (Quadratic Programming) The differences between the problems are: The objective function becomes minimizing the portfolio