A novel hybrid PSO-based metaheuristic for costly portfolio selection problems
DOI10.1007/s10479-021-04075-3zbMath1480.90200OpenAlexW3154623308MaRDI QIDQ2241553
Giovanni Fasano, Giacomo di Tollo, Raffaele Pesenti, Marco Corazza
Publication date: 9 November 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-021-04075-3
iraceglobal optimizationexact penalty functionsparticle swarm optimizationhybrid metaheuristicsportfolio selection problemsREVAC
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Portfolio theory (91G10)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Particle swarm optimization with non-smooth penalty reformulation, for a complex portfolio selection problem
- Dynamic analysis for the selection of parameters and initial population, in particle swarm optimization
- Schwarz methods over the course of time
- Parameter setting in evolutionary algorithms.
- The particle swarm optimization algorithm: Convergence analysis and parameter selection
- Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs
- Coherent Measures of Risk
- The Sequential Parameter Optimization Toolbox
- Nonlinearly Constrained Optimization Using Heuristic Penalty Methods and Asynchronous Parallel Generating Set Search
- Exact penalty functions in nonlinear programming
- Mean-absolute deviation portfolio optimization model under transaction costs
- Bioinspired Heuristics for Optimization
- Adaptive Tunning of All Parameters in a Multi-Swarm Particle Swarm Optimization Algorithm: An Application to the Probabilistic Traveling Salesman Problem
- Nonlinear Programming
- Non-Linear Programming Via Penalty Functions
- Introduction to evolutionary computing
This page was built for publication: A novel hybrid PSO-based metaheuristic for costly portfolio selection problems