Robust online portfolio optimization with cash flows

被引:0
|
作者
Lyu, Benmeng [1 ,2 ]
Wu, Boqian [4 ]
Guo, Sini [3 ]
Gu, Jia-Wen [2 ]
Ching, Wai-Ki [1 ]
机构
[1] Univ Hong Kong, Dept Math, Hong Kong 999077, Peoples R China
[2] Southern Univ Sci & Technol, Dept Math, Shenzhen 518055, Peoples R China
[3] Beijing Inst Technol, Sch Management, Beijing 100081, Peoples R China
[4] Univ Twente, Fac Elect Engn Math & Comp Sci, NL-7522 NB Enschede, Netherlands
来源
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 2024年 / 129卷
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Decision making; Cash flow; Linear programming; Transaction costs; Robust optimization; SELECTION; ALGORITHMS; STRATEGY;
D O I
10.1016/j.omega.2024.103169
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
One fundamental issue in finance is portfolio selection, which seeks the best strategy for assigning capital among a group of assets. There has been growing interest in online portfolio selection where the investment strategy is frequently readjusted in a short time as new financial market data arrives constantly. Numerous effective algorithms have been extensively examined both in terms of theoretical analysis and empirical evaluation. Previous online portfolio selection algorithms that incorporate transaction costs are limited by the fact that they often approximate the transaction remainder factor instead of calculating it precisely. This could lead to suboptimal investment performance. To address this issue, we present an innovative method that considers transaction costs and resolves the accurate transaction remainder factor and the optimal portfolio allocation simultaneously for each period. In addition, we take into account the open-end fund, which permits constant cash inflows, and develop a framework for online portfolio selection. We also incorporate the uncertainty set to minimize the impact of the prediction error during the prediction process. Utilizing the framework presented in this innovative model, we develop a novel algorithm for online portfolio selection that incorporates transaction costs and continuous cash inflows with the objective of maximizing cumulative wealth. Numerical experiments show that the proposed algorithms are able to handle transaction costs and constant cash inflows effectively.
引用
收藏
页数:15
相关论文
共 50 条
  • [21] Robust portfolio optimization: a conic programming approach
    Ye, Kai
    Parpas, Panos
    Rustem, Berc
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2012, 52 (02) : 463 - 481
  • [22] A robust knapsack based constrained portfolio optimization
    Vaezi F.
    Sadjadi S.J.
    Makui A.
    Sadjadi, S.J. (sjsadjadi@iust.ac.ir), 1600, Materials and Energy Research Center (33): : 841 - 851
  • [23] Robust optimization and portfolio selection: The cost of robustness
    Gregory, Christine
    Darby-Dowman, Ken
    Mitra, Gautam
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 212 (02) : 417 - 428
  • [24] Robust portfolio optimization with a hybrid heuristic algorithm
    Fastrich, Bjoern
    Winker, Peter
    COMPUTATIONAL MANAGEMENT SCIENCE, 2012, 9 (01) : 63 - 88
  • [25] Robust portfolio optimization: a conic programming approach
    Kai Ye
    Panos Parpas
    Berç Rustem
    Computational Optimization and Applications, 2012, 52 : 463 - 481
  • [26] Robust portfolio optimization with a hybrid heuristic algorithm
    Björn Fastrich
    Peter Winker
    Computational Management Science, 2012, 9 (1) : 63 - 88
  • [27] Robust and Sparse Portfolio: Optimization Models and Algorithms
    Zhao, Hongxin
    Jiang, Yilun
    Yang, Yizhou
    MATHEMATICS, 2023, 11 (24)
  • [28] Robust portfolio optimization: a categorized bibliographic review
    Xidonas, Panos
    Steuer, Ralph
    Hassapis, Christis
    ANNALS OF OPERATIONS RESEARCH, 2020, 292 (01) : 533 - 552
  • [29] ROBUST OPTIMIZATION IN PORTFOLIO SELECTION BY m-MAD MODEL APPROACH
    Ghahtarani, Alireza
    Najafi, Amir Abbas
    ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH, 2018, 52 (01): : 279 - 291
  • [30] Robust discrete optimization and network flows
    Bertsimas, D
    Sim, M
    MATHEMATICAL PROGRAMMING, 2003, 98 (1-3) : 49 - 71