On the Computation of the Efficient Frontier in Advanced Sparse Portfolio Optimization
Abstract
In this work, we deal with the problem of computing a comprehensive front of efficient solutions in multi-objective portfolio optimization problems in presence of sparsity constraints. We start the discussion pointing out some weaknesses of the classical linear scalarization approach when applied to the considered class of problems. We are then motivated to propose a suitable algorithmic framework that is designed to overcome these limitations: the novel algorithm combines a gradient-based exploration-refinement strategy with a tailored initialization scheme based on memetic or multi-start descent procedures. Thorough computational experiments highlight how the proposed method is far superior to both linear scalarization and popular genetic algorithms.
Cite
@article{arxiv.2501.19199,
title = {On the Computation of the Efficient Frontier in Advanced Sparse Portfolio Optimization},
author = {Arturo Annunziata and Matteo Lapucci and Pieluigi Mansueto and Davide Pucci},
journal= {arXiv preprint arXiv:2501.19199},
year = {2025}
}