A Fast Algorithm for Computing High-dimensional Risk Parity Portfolios
classification
💱 q-fin.PM
keywords
algorithmalgorithmsfastparityriskcomparisoncomputingconverges
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.