A Fast Algorithm for Computing High-dimensional Risk Parity Portfolios
2013-11-16Code Available1· sign in to hype
Théophile Griveau-Billion, Jean-Charles Richard, Thierry Roncalli
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/jcrichard/pyrbOfficialnone★ 0
- github.com/dppalomar/riskparity.pyjax★ 318
- github.com/cran/riskParityPortfolionone★ 0
- github.com/dppalomar/riskParityPortfolionone★ 0
Abstract
In this paper we propose a cyclical coordinate descent (CCD) algorithm for solving high dimensional risk parity problems. We show that this algorithm converges and is very fast even with large covariance matrices (n > 500). Comparison with existing algorithms also shows that it is one of the most efficient algorithms.