An algorithm for moment-matching scenario generation with application to financial portfolio optimisation

被引:18
|
作者
Ponomareva, K. [1 ]
Roman, D. [1 ]
Date, P. [1 ]
机构
[1] Brunel Univ, Sch Informat Syst Comp & Math, Uxbridge UB8 3PH, Middx, England
关键词
Scenarios; OR in banking; Finance; Stochastic programming; HIDDEN MARKOV-MODELS; TREE GENERATION; DISTRIBUTIONS;
D O I
10.1016/j.ejor.2014.07.049
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We present an algorithm for moment-matching scenario generation. This method produces scenarios and corresponding probability weights that match exactly the given mean, the covariance matrix, the average of the marginal skewness and the average of the marginal kurtosis of each individual component of a random vector. Optimisation is not employed in the scenario generation process and thus the method is computationally more advantageous than previous approaches. The algorithm is used for generating scenarios in a mean-CVaR portfolio optimisation model. For the chosen optimisation example, it is shown that desirable properties for a scenario generator are satisfied, including in-sample and out-of-sample stability. It is also shown that optimal solutions vary only marginally with increasing number of scenarios in this example; thus, good solutions can apparently be obtained with a relatively small number of scenarios. The proposed method can be used either on its own as a computationally inexpensive scenario generator or as a starting point for non-convex optimisation based scenario generators which aim to match all the third and the fourth order marginal moments (rather than average marginal moments). (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:678 / 687
页数:10
相关论文
共 27 条
  • [1] Comment on "An algorithm for moment-matching scenario generation with application to financial portfolio optimization"
    Pablo Contreras, Juan
    Bosch, Paul
    Herrera, Mauricio
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 269 (03) : 1180 - 1184
  • [2] A Heuristic for Moment-Matching Scenario Generation
    Kjetil Høyland
    Michal Kaut
    Stein W. Wallace
    [J]. Computational Optimization and Applications, 2003, 24 : 169 - 185
  • [3] A heuristic for moment-matching scenario generation
    Hoyland, K
    Kaut, M
    Wallace, SW
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2003, 24 (2-3) : 169 - 185
  • [4] A moment-matching Ferguson & Klass algorithm
    Arbel, Julyan
    Prunster, Igor
    [J]. STATISTICS AND COMPUTING, 2017, 27 (01) : 3 - 17
  • [5] A moment-matching Ferguson & Klass algorithm
    Julyan Arbel
    Igor Prünster
    [J]. Statistics and Computing, 2017, 27 : 3 - 17
  • [6] Scenario generation in stochastic programming using principal component analysis based on moment-matching approach
    Chopra, Isha
    Selvamuthu, Dharmaraja
    [J]. OPSEARCH, 2020, 57 (01) : 190 - 201
  • [7] Scenario generation in stochastic programming using principal component analysis based on moment-matching approach
    Isha Chopra
    Dharmaraja Selvamuthu
    [J]. OPSEARCH, 2020, 57 : 190 - 201
  • [8] A SCENARIO GENERATION METHOD WITH HETEROSKEDASTICITY AND MOMENT MATCHING
    Deniz, Erhan
    Luxhoj, James T.
    [J]. ENGINEERING ECONOMIST, 2011, 56 (03): : 231 - 253
  • [9] Sampling-based speech parameter generation using moment-matching networks
    Takamichi, Shinnosuke
    Koriyama, Tomoki
    Saruwatari, Hiroshi
    [J]. 18TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION (INTERSPEECH 2017), VOLS 1-6: SITUATED INTERACTION, 2017, : 3961 - 3965
  • [10] AN IMPROVED MOMENT-MATCHING ALGORITHM FOR EVALUATING TOP-EVENT PROBABILITY BOUNDS
    TAKARAGI, K
    SASAKI, R
    SHINGAI, S
    [J]. IEEE TRANSACTIONS ON RELIABILITY, 1982, 31 (01) : 45 - 48