Vom 20.12.2025 bis 11.01.2026 ist die Universitätsbibliothek geschlossen. Ab dem 12.01.2026 gelten wieder die regulären Öffnungszeiten. Ausnahme: Medizinische Hauptbibliothek und Zentralbibliothek sind bereits ab 05.01.2026 wieder geöffnet. Weitere Informationen

Treffer: Portfolio Optimization Using CART and Genetic Algorithm.

Title:
Portfolio Optimization Using CART and Genetic Algorithm.
Source:
European Journal of Pure & Applied Mathematics; Jul2025, Vol. 18 Issue 3, p1-19, 19p
Database:
Complementary Index

Weitere Informationen

In this article, we present an approach based on the approximation of data by segmentation using the CART algorithm and Genetic algorithms, with a view to constructing an optimal portfolio-extract of financial assets. This approach generates a surplus of financial gains in terms of costs, and improves performance by reducing computing loads. This is a three-stage process: the first is to represent the financial series using a piecewise linear approximation obtained by CART, where the trend change points are optimally determined by segmentation of the series into periods of economic regime change. In the second stage, once the segments have been determined, each segment is represented in the plan (yield, volatility). We then develop an algorithm that selects the top ten financial assets in the overall portfolio, known as the extracted portfolio, in terms of the best ratio between return and VaR. In the third step, we apply heuristic optimization algorithms based on Genetic Algorithms and Particle Swarm Optimization to the extracted portfolio. The aim of this algorithm is to optimize the weights that will minimize the VaR and maximize the value of the extracted portfolio. [ABSTRACT FROM AUTHOR]

Copyright of European Journal of Pure & Applied Mathematics is the property of New York Business Global LLC and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)