Cardinality-Constrained Higher-Order Moment Portfolios Using Particle Swarm Optimization
Mulazim-Ali Khokhar (),
Kris Boudt and
Additional contact information
Mulazim-Ali Khokhar: Vrije Universiteit Brussel
Chunlin Wan: Sichuan University
Chapter Chapter 10 in Applying Particle Swarm Optimization, 2021, pp 169-187 from Springer
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.
Keywords: Particle swarm optimization; Cardinality mapping; Higher-order moment portfolio (search for similar items in EconPapers)
References: Add references at CitEc
Citations: Track citations by RSS feed
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-030-70281-6_10
Ordering information: This item can be ordered from
Access Statistics for this chapter
More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().