A Fast Algorithm for Computing High-dimensional Risk Parity Portfolios
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.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Roncalli, Thierry, 2013.
"Introduction to Risk Parity and Budgeting,"
47679, University Library of Munich, Germany.
- repec:dau:papers:123456789/4688 is not listed on IDEAS
- Friedman, Jerome H. & Hastie, Trevor & Tibshirani, Rob, 2010. "Regularization Paths for Generalized Linear Models via Coordinate Descent," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 33(i01).
- T. Heller & R. Huet & Bénédicte Vidaillet, 2013. "Introduction," Post-Print hal-00848256, HAL.
- Cazalet, Zelia & Grison, Pierre & Roncalli, Thierry, 2013. "The Smart Beta Indexing Puzzle," MPRA Paper 48823, University Library of Munich, Germany.
- Bruder, Benjamin & Roncalli, Thierry, 2012. "Managing risk exposures using the risk budgeting approach," MPRA Paper 37246, University Library of Munich, Germany.
- Roncalli, Thierry, 2013. "Introducing Expected Returns into Risk Parity Portfolios: A New Framework for Tactical and Strategic Asset Allocation," MPRA Paper 49821, University Library of Munich, Germany. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:arx:papers:1311.4057. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.