2012
DOI: 10.1007/s10479-012-1207-1
|View full text |Cite
|
Sign up to set email alerts
|

Exact and heuristic approaches for the index tracking problem with UCITS constraints

Abstract: Index tracking aims at determining an optimal portfolio that replicates the performance of an index or benchmark by investing in a smaller number of constituents or assets. The tracking portfolio should be cheap to maintain and update, i.e., invest in a smaller number of constituents than the index, have low turnover and low transaction costs, and should avoid large positions in few assets, as required by the European Union Directive UCITS (Undertaking for Collective Investments in Transferable Securities) rul… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0
3

Year Published

2013
2013
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 47 publications
(25 citation statements)
references
References 30 publications
0
22
0
3
Order By: Relevance
“…The proposed representation of subsets should be of general interest because it can be used in genetic algorithms for any optimization problem that involves the selection of a subset, such as the feature-selection problem in machine learning. Second, we present a new MIQP formulation of the UCITP that requires fewer constraints than the existing formulation of Scozzari et al [49]. Third, we present a new two-stage approach to the UCITP that is able to devise very good feasible solutions for UCITP instances of arbitrary size in a short CPU time.…”
Section: A C C E P T E D Mmentioning
confidence: 98%
See 2 more Smart Citations
“…The proposed representation of subsets should be of general interest because it can be used in genetic algorithms for any optimization problem that involves the selection of a subset, such as the feature-selection problem in machine learning. Second, we present a new MIQP formulation of the UCITP that requires fewer constraints than the existing formulation of Scozzari et al [49]. Third, we present a new two-stage approach to the UCITP that is able to devise very good feasible solutions for UCITP instances of arbitrary size in a short CPU time.…”
Section: A C C E P T E D Mmentioning
confidence: 98%
“…In the literature, two approaches to the UCITP have been proposed: a mixed-integer quadratic programming (MIQP) approach (cf. Scozzari et al [49]) and an approach based on differential evolution and combinatorial search (cf. Krink et al [29]).…”
Section: Accepted Manuscriptmentioning
confidence: 99%
See 1 more Smart Citation
“…The DE algorithm has also been used in other recent studies using hybrid and multi-objective schemes Krink and Paterlini, 2011), as well as in the context of loss aversion (Maringer, 2008) and mutual fund replication (Zhang and Maringer, 2010). Other recently proposed algorithmic procedures include immune systems (Li et al, 2011), hybrid algorithms (Ruiz-Torrubiano and Suárez, 2009;Scozzari et al 2012), robust optimization (Chen and Kwon, 2012) and mixed-integer programming formulations (Canakgoz and Beasley, 2008;Stoyan and Kwon, 2010). An overview of different methods can be found in Woodside-Oriakhi et al (2011).…”
Section: Evolutionary Solution Techniquesmentioning
confidence: 99%
“…Different formulations for the IT problem have been proposed in the literature, such as optimization (Konno and Wijayanayake, 2001;Mezali and Beasley, 2013), optimization combined with simulation (Consiglio and Zenios, 2001), heuristic methods (Beasley et al, 2003;Scozzari et al, 2013), cointegration (Alexander, 1999;Alexander and Dimitriu, 2005), and lasso-type regression (Wu et al, 2014;Yang and Wu, 2016). In spite of their methodological distinctions, however, past studies usually carry out their analysis considering a standard feature, which is the use of a cardinality constraint to limit the size of the tracking portfolios and diminish transaction costs.…”
Section: Introductionmentioning
confidence: 99%