On the Computation of the Efficient Frontier in Advanced Sparse Portfolio Optimization
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916959483854848 |
|---|---|
| author | Annunziata, Arturo Lapucci, Matteo Mansueto, Pieluigi Pucci, Davide |
| author_facet | Annunziata, Arturo Lapucci, Matteo Mansueto, Pieluigi Pucci, Davide |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_19199 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the Computation of the Efficient Frontier in Advanced Sparse Portfolio Optimization Annunziata, Arturo Lapucci, Matteo Mansueto, Pieluigi Pucci, Davide Optimization and Control 90C29, 90C26, 90B50, 91G10 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. |
| title | On the Computation of the Efficient Frontier in Advanced Sparse Portfolio Optimization |
| topic | Optimization and Control 90C29, 90C26, 90B50, 91G10 |
| url | https://arxiv.org/abs/2501.19199 |