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.

MoreLess

Year of publication:	2013-09-01
Authors:	Griveau-Billion, Théophile ; Richard, Jean-Charles ; Roncalli, Thierry

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Type of publication:	Book / Working Paper
Language:	English
Notes:	Griveau-Billion, Théophile and Richard, Jean-Charles and Roncalli, Thierry (2013): A Fast Algorithm for Computing High-dimensional Risk Parity Portfolios.
Classification:	C60 - Mathematical Methods and Programming. General ; G11 - Portfolio Choice
Source:	BASE

Persistent link: https://www.econbiz.de/10015238743