Efficient implementation of an active set algorithm for large-scale portfolio selection

  • Authors:

  • Michael Stein;Jürgen Branke;Hartmut Schmeck

  • Affiliations:

  • Institute for Applied Informatics and Formal Description Methods (AIFB), University of Karlsruhe (TH), Germany;Institute for Applied Informatics and Formal Description Methods (AIFB), University of Karlsruhe (TH), Germany;Institute for Applied Informatics and Formal Description Methods (AIFB), University of Karlsruhe (TH), Germany

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper deals with the efficient implementation of parametric quadratic programming that is specialized for large-scale mean-variance portfolio selection with a dense covariance matrix. The aim is to calculate the whole Pareto front of solutions that represent the trade-off between maximizing expected return and minimizing variance of return. We describe and compare in a uniform framework several techniques to speed up the necessary matrix operations, namely the initial matrix decomposition, the solution process in each iteration, and the matrix updates. Techniques considered include appropriate ordering of the matrix rows and columns, reducing the size of the system of linear equations, and dividing the system into two parts. Regarding implementation, we suggest to simultaneously use two different matrix representations that are specifically adapted to certain parts of the algorithm and propose a technique that prevents algorithm stalling due to numerical errors. Finally, we analyse and compare the runtime of these algorithm variants on a set of benchmark problems. As we demonstrate, the most sophisticated variant is several orders of magnitude faster than the standard implementation on all tested problem instances.