Logo
Munich Personal RePEc Archive

A Fast Algorithm for Computing High-dimensional Risk Parity Portfolios

Griveau-Billion, Théophile and Richard, Jean-Charles and Roncalli, Thierry (2013): A Fast Algorithm for Computing High-dimensional Risk Parity Portfolios.

This is the latest version of this item.

[thumbnail of MPRA_paper_49844.pdf]
Preview
PDF
MPRA_paper_49844.pdf

Download (503kB) | Preview

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.

Available Versions of this Item

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.