Algorithms for \(l_{1}\)-norm minimisation of index tracking error and their performance (Q2204337)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for lā-norm minimisation of index tracking error and their performance |
scientific article; zbMATH DE number 7261427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for \(l_{1}\)-norm minimisation of index tracking error and their performance |
scientific article; zbMATH DE number 7261427 |
Statements
Algorithms for \(l_{1}\)-norm minimisation of index tracking error and their performance (English)
0 references
15 October 2020
0 references
Summary: 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_{1}\)-norm (greedy algorithm, algorithm for \(l_{1}\)-norm minimisation with relaxation and differential evolution algorithm) and compare the empirical performance of the portfolios obtained by means of the algorithms.
0 references
index tracking
0 references
portfolio optimisation
0 references
greedy algorithms
0 references
differential evolution algorithms
0 references
0.8201748132705688
0 references
0.8195613026618958
0 references
0.8163754940032959
0 references
0.8066979646682739
0 references