Local Search Techniques for Constrained Portfolio Selection Problems
Andrea Schaerf
Abstract
We consider the problem of selecting a portfolio of assets that provides the investor a suitable balance of expected return and risk. With respect to the seminal mean-variance model of Markowitz, we consider additional constraints on the cardinality of the portfolio and on the quantity of individual shares. Such constraints better capture the real-world trading system, but make the problem more difficult to be solved with exact methods. We explore the use of local search techniques, mainly tabu search, for the portfolio selection problem. We compare and combine previous work on portfolio selection that makes use of the local search approach and we propose new algorithms that combine different neighborhood relations. In addition, we show how the use of randomization and of a simple form of adaptiveness simplifies the setting of a large number of critical parameters. Finally, we show how our techniques perform on public benchmarks.
Create a lesson
Related papers
Towards a Benchmark for Fire Safety Code Interpretation in the Hong Kong AEC Industry
Le Qiu, Zhuan Anne Zhang, Hok Ming Adeline Chan et al.
How the Classical Baseline Shapes Machine-Learning Speed Claims in Topology Optimization
Shaoliang Yang, Jun Wang
An Adjoint Krylov Approach to Parameter Inference for Affine Families of Linear Evolution Equations
Aditya Dendukuri, Shivkumar Chandrasekaran, Linda Petzold
Koopman Operator Inference for the Chemical Master Equation
Aditya Dendukuri, Linda Petzold
Generative AI enables human-centered design of sustainable plant-based foods
Vahidullah Tac, Ellen Kuhl
Inspect Any Crack: An Automated End-to-End Crack Segmentation and Severity Assessment Framework
Ghodsiyeh Rostami, Po-Han Chen, Mahdi S. Hosseini