Modern Portfolio Theory dates back from the fifties, and quantitative approaches to solve optimization problems stemming from this field have been proposed ever since. We propose a metaheuristic approach for the Portfolio Selection Problem that combines local search and Quadratic Programming, and we compare our approach with an exact solver. Search space and correlation analysis are performed to analyse the algorithm’s performance, showing that metaheuristics can be efficiently used to determine optimal portfolio allocation.
Titolo: | Local search algorithms for portfolio selection: Search space and correlation analysis | |
Autore/i: | di Tollo, Giacomo; ROLI, ANDREA | |
Autore/i Unibo: | ||
Anno: | 2016 | |
Titolo del libro: | Studies in Computational Intelligence | |
Pagina iniziale: | 21 | |
Pagina finale: | 38 | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1007/978-3-319-40132-4_2 | |
Abstract: | Modern Portfolio Theory dates back from the fifties, and quantitative approaches to solve optimization problems stemming from this field have been proposed ever since. We propose a metaheuristic approach for the Portfolio Selection Problem that combines local search and Quadratic Programming, and we compare our approach with an exact solver. Search space and correlation analysis are performed to analyse the algorithm’s performance, showing that metaheuristics can be efficiently used to determine optimal portfolio allocation. | |
Data stato definitivo: | 24-mag-2017 | |
Appare nelle tipologie: | 2.01 Capitolo / saggio in libro |
File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.