Abstract
Particle swarm optimization (PSO) is often used for solving cardinality-constrained portfolio optimization problems. The system invests in at most k out of N possible assets using a binary mapping that enforces compliance with the cardinality constraint. This may lead to sparse solution vectors driving the velocity in PSO algorithm. This sparse-velocity mapping leads to early stagnation in mean-variance-skewness-kurtosis expected utility optimization when k is small compared to N. A continuous-velocity driver addresses this issue. We propose to combine both the continuous- and the sparse-velocity transformation methods so that it updates local and global best positions based on both the drivers. We document the performance gains when k is small compared to N in the case of mean-variance-skewness-kurtosis expected utility optimization of the portfolio.
Original language | English |
---|---|
Title of host publication | Applying Particle Swarm Optimization |
Subtitle of host publication | New Solutions and Cases for Optimized Portfolios |
Editors | Burcu Adıgüzel Mercangöz |
Publisher | Springer |
Pages | 169-187 |
Number of pages | 19 |
ISBN (Electronic) | 9783030702816 |
ISBN (Print) | 9783030702809, 9783030702830 |
DOIs | |
Publication status | Published - 2021 |
Publication series
Name | International Series in Operations Research and Management Science |
---|---|
Publisher | Springer |
Volume | 306 |
ISSN (Print) | 0884-8289 |
ISSN (Electronic) | 2214-7934 |
Bibliographical note
Publisher Copyright:© 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
Keywords
- Cardinality mapping
- Higher-order moment portfolio
- Particle swarm optimization