Algorithms for l 1 -norm minimisation of index tracking error and their performance

Sergei P. Sidorov, Alexey R. Faizliev and Andrew A. Khomchenko

International Journal of Mathematics in Operational Research, 2017, vol. 11, issue 4, 497-519

Abstract: The paper considers the index tracking problem with cardinality constraint and examines different methods for the numerical solution of the problem. Index tracking is a passive financial strategy that tries to replicate the performance of a given index or benchmark. The aim of investor is to find the weights of assets in her/his portfolio that minimise the tracking error, i.e., difference between the performance of the index and the portfolio. In this paper, we examine three different algorithms for index tracking error minimisation in l₁-norm (greedy algorithm, algorithm for l₁-norm minimisation with relaxation and differential evolution algorithm) and compare the empirical performance of the portfolios obtained by means of the algorithms.

Keywords: index tracking; portfolio optimisation; greedy algorithms; differential evolution algorithms. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=87743 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:11:y:2017:i:4:p:497-519

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().