Optimization of venture portfolio based on LSTM and dynamic programming

被引:3
|
作者
Ban, Jiuchao [1 ]
Wang, Yiran [1 ]
Liu, Bingjie [1 ]
Li, Hongjun [1 ]
机构
[1] Beijing Forestry Univ, Coll Sci, Beijing 100083, Peoples R China
来源
AIMS MATHEMATICS | 2023年 / 8卷 / 03期
关键词
portfolio; LSTM time series; greedy algorithm; dynamic programming;
D O I
10.3934/math.2023275
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A rational investor always pursues a portfolio with the greatest possible return and the least possible risk. Therefore, a core issue of investment decision analysis is how to make an optimal investment choice in the market with fuzzy information and realize the balance between maximizing the return on assets and minimizing the risk. In order to find optimal investment portfolios of financial assets with high volatility, such as gold and Bitcoin, a mathematical model for formulating investment strategies based on the long short-term memory time series and the dynamic programming model combined with the greedy algorithm has been proposed in this paper. The model provides the optimal daily strategy for the five-year trading period so that it can achieve the maximum expected return every day under the condition of a certain investment amount and a certain risk. In addition, a reasonable risk measure based on historical increases is established while considering the weights brought by different investment preferences. The empirical analysis results show that the optimal total assets and initial capital obtained by the model change in the same proportion, and the model is relatively stable and has strong adaptability to the initial capital. Therefore, the proposed model has practical reference value and research significance for investors and promotes a better combination of computer technology and financial investment decision.
引用
收藏
页码:5462 / 5483
页数:22
相关论文
共 50 条
  • [1] Constrained portfolio optimization with discrete variables: An algorithmic method based on dynamic programming
    Jezeie, Fereshteh Vaezi
    Sadjadi, Seyed Jafar
    Makui, Ahmad
    [J]. PLOS ONE, 2022, 17 (07):
  • [2] A LSTM-based approximate dynamic programming method for hydropower reservoir operation optimization
    Feng, Zhong-kai
    Luo, Tao
    Niu, Wen-jing
    Yang, Tao
    Wang, Wen-chuan
    [J]. JOURNAL OF HYDROLOGY, 2023, 625
  • [3] Twenty years of linear programming based portfolio optimization
    Mansini, Renata
    Ogryczak, Wlodzimierz
    Speranza, M. Grazia
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 234 (02) : 518 - 535
  • [4] An interactive approach to stochastic programming-based portfolio optimization
    Murat Köksalan
    Ceren Tuncer Şakar
    [J]. Annals of Operations Research, 2016, 245 : 47 - 66
  • [5] An interactive approach to stochastic programming-based portfolio optimization
    Koksalan, Murat
    Sakar, Ceren Tuncer
    [J]. ANNALS OF OPERATIONS RESEARCH, 2016, 245 (1-2) : 47 - 66
  • [6] PORTFOLIO OPTIMIZATION WITH LINEAR PROGRAMMING BASED ON TRAPEZOIDAL FUZZY NUMBERS
    Akbas, Serkan
    Erbay Dalkilic, Turkan
    [J]. JOURNAL OF MEHMET AKIF ERSOY UNIVERSITY ECONOMICS AND ADMINISTRATIVE SCIENCES FACULTY, 2019, 6 (03): : 634 - 650
  • [7] Portfolio Optimization Model Based on CVaR Programming and Limits of MAD
    Cao, Jinsheng
    [J]. PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON EDUCATION TECHNOLOGY, MANAGEMENT AND HUMANITIES SCIENCE (ETMHS 2015), 2015, 27 : 109 - 112
  • [8] Portfolio optimization based on bi-objective linear programming
    Izadi, Marzie
    Yaghoobi, Mohammad Ali
    [J]. RAIRO-OPERATIONS RESEARCH, 2024, 58 (01) : 713 - 739
  • [9] A Semidefinite Programming Approach to Portfolio Optimization
    Fonseca, Raquel J.
    Wiesemann, Wolfram
    Rustem, Berc
    [J]. 21ST EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, 2011, 29 : 472 - 476
  • [10] Algorithm portfolio based scheme for dynamic optimization problems
    Fajardo Calderin, Jenny
    Masegosa, Antonio D.
    Pelta, David A.
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2015, 8 (04) : 667 - 689