Application of Genetic Optimization Algorithm in Financial Portfolio Problem

In order to address the application of genetic optimization algorithms to financial investment portfolio issues, the optimal allocation rate must be high and the risk is low. This paper uses quadratic programming algorithms and genetic algorithms as well as quadratic programming algorithms, Matlab planning solutions for genetic algorithms, and genetic algorithm toolboxes to solve Markowitz's mean variance model. The mathematical model for introducing sparse portfolio strategies uses the decomposition method of penalty functions as an algorithm for solving nonconvex sparse optimization strategies to solve financial portfolio problems. The merging speed of the quadratic programming algorithm is fast, and the merging speed depends on the selection of the initial value. The genetic algorithm performs very well in global searches, but local search capabilities are insuficient and the pace of integration into the next stage is slow. To solve this, using a genetic algorithm toolbox is quick and easy. The results of the experiments show that the final solution of the decomposition method of the fine function is consistent with the solution of the integrity of the genetic algorithm. 67% of the total funds will be spent on local car reserves and 33% on wine reserves. When data scales are small, quadratic programming algorithms and genetic algorithms can provide effective portfolio feedback, and the method of breaking down penalty functions to ensure the reliability and effectiveness of algorithm combinations is widely used in sparse financial portfolio issues.