IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v285y2020i1p106-119.html
   My bibliography  Save this article

Importance sampling in stochastic optimization: An application to intertemporal portfolio choice

Author

Listed:
  • Ekblom, J.
  • Blomvall, J.

Abstract

In this paper, we propose an approach to construct an analytical approximation of the zero-variance importance sampling distribution. We show specifically how this can be designed for the classic intertemporal portfolio choice problem with proportional transaction costs and constant relative risk aversion preferences. We compare the method to standard variance reduction techniques in single-period optimization and multi-stage stochastic programming formulations of the problem. The numerical experiments show that the method produces significant improvements in solution quality. In the single-period setting, the number of scenarios can be reduced by a factor of 400 with maintained solution quality compared to the best standard method; Latin hypercube sampling. Using importance sampling in multi-stage formulations, the gaps between lower and upper bound estimates are reduced by a factor of 26-500 with maintained scenario tree size. On a higher level, we consider analytical approximations of the zero-variance importance sampling distribution to be a promising method to improve solution quality in stochastic optimization.

Suggested Citation

  • Ekblom, J. & Blomvall, J., 2020. "Importance sampling in stochastic optimization: An application to intertemporal portfolio choice," European Journal of Operational Research, Elsevier, vol. 285(1), pages 106-119.
    • Handle: RePEc:eee:ejores:v:285:y:2020:i:1:p:106-119
    DOI: 10.1016/j.ejor.2019.01.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719300153
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.01.013?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Panos Parpas & Berk Ustun & Mort Webster & Quang Kha Tran, 2015. "Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 358-377, May.
    2. Kouwenberg, Roy, 2001. "Scenario generation and stochastic programming models for asset liability management," European Journal of Operational Research, Elsevier, vol. 134(2), pages 279-292, October.
    3. David B. Brown & James E. Smith, 2011. "Dynamic Portfolio Optimization with Transaction Costs: Heuristics and Dual Bounds," Management Science, INFORMS, vol. 57(10), pages 1752-1770, October.
    4. Fleten, Stein-Erik & Hoyland, Kjetil & Wallace, Stein W., 2002. "The performance of stochastic dynamic and fixed mix portfolio models," European Journal of Operational Research, Elsevier, vol. 140(1), pages 37-49, July.
    5. Luis M. Viceira, 2001. "Optimal Portfolio Choice for Long‐Horizon Investors with Nontradable Labor Income," Journal of Finance, American Finance Association, vol. 56(2), pages 433-470, April.
    6. Ronald Hochreiter & Georg Pflug, 2007. "Financial scenario generation for stochastic multi-stage decision processes as facility location problems," Annals of Operations Research, Springer, vol. 152(1), pages 257-272, July.
    7. M.A.H. Dempster & R.T. Thompson, 1999. "EVPI‐based importance sampling solution proceduresfor multistage stochastic linear programmeson parallel MIMD architectures," Annals of Operations Research, Springer, vol. 90(0), pages 161-184, January.
    8. Kjetil Høyland & Stein W. Wallace, 2001. "Generating Scenario Trees for Multistage Decision Problems," Management Science, INFORMS, vol. 47(2), pages 295-307, February.
    9. Michael A.H. Dempster & Elena A. Medova & Yee Sook Yong, 2011. "Comparison of Sampling Methods for Dynamic Stochastic Programming," International Series in Operations Research & Management Science, in: Marida Bertocchi & Giorgio Consigli & Michael A. H. Dempster (ed.), Stochastic Optimization Methods in Finance and Energy, edition 1, chapter 0, pages 389-425, Springer.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Agnieszka Konicz & David Pisinger & Alex Weissensteiner, 2015. "Optimal annuity portfolio under inflation risk," Computational Management Science, Springer, vol. 12(3), pages 461-488, July.
    2. Wei Zhang & Kai Wang & Alexandre Jacquillat & Shuaian Wang, 2023. "Optimized Scenario Reduction: Solving Large-Scale Stochastic Programs with Quality Guarantees," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 886-908, July.
    3. Fan, Wei & Machemehl, Randy, 2004. "A Multi-stage Monte Carlo Sampling Based Stochastic Programming Model for the Dynamic Vehicle Allocation Problem," 45th Annual Transportation Research Forum, Evanston, Illinois, March 21-23, 2004 208244, Transportation Research Forum.
    4. Staino, Alessandro & Russo, Emilio, 2015. "A moment-matching method to generate arbitrage-free scenarios," European Journal of Operational Research, Elsevier, vol. 246(2), pages 619-630.
    5. Libo Yin & Liyan Han, 2013. "Options strategies for international portfolios with overall risk management via multi-stage stochastic programming," Annals of Operations Research, Springer, vol. 206(1), pages 557-576, July.
    6. Fan, Wei, 2014. "Optimizing Strategic Allocation of Vehicles for One-Way Car-sharing Systems Under Demand Uncertainty," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 53(3).
    7. Zhe Yan & Zhiping Chen & Giorgio Consigli & Jia Liu & Ming Jin, 2020. "A copula-based scenario tree generation algorithm for multiperiod portfolio selection problems," Annals of Operations Research, Springer, vol. 292(2), pages 849-881, September.
    8. Gulpinar, Nalan & Rustem, Berc & Settergren, Reuben, 2004. "Simulation and optimization approaches to scenario tree generation," Journal of Economic Dynamics and Control, Elsevier, vol. 28(7), pages 1291-1315, April.
    9. Wu, Dexiang & Wu, Desheng Dash, 2020. "A decision support approach for two-stage multi-objective index tracking using improved lagrangian decomposition," Omega, Elsevier, vol. 91(C).
    10. D. Kuhn, 2009. "Convergent Bounds for Stochastic Programs with Expected Value Constraints," Journal of Optimization Theory and Applications, Springer, vol. 141(3), pages 597-618, June.
    11. Davi Valladão & Thuener Silva & Marcus Poggi, 2019. "Time-consistent risk-constrained dynamic portfolio optimization with transactional costs and time-dependent returns," Annals of Operations Research, Springer, vol. 282(1), pages 379-405, November.
    12. Jacek Gondzio & Roy Kouwenberg, 2001. "High-Performance Computing for Asset-Liability Management," Operations Research, INFORMS, vol. 49(6), pages 879-891, December.
    13. Zhao, Daping & Bai, Lin & Fang, Yong & Wang, Shouyang, 2022. "Multi‐period portfolio selection with investor views based on scenario tree," Applied Mathematics and Computation, Elsevier, vol. 418(C).
    14. John M. Mulvey & Koray D. Simsek & Zhuojuan Zhang & Frank J. Fabozzi & William R. Pauling, 2008. "OR PRACTICE---Assisting Defined-Benefit Pension Plans," Operations Research, INFORMS, vol. 56(5), pages 1066-1078, October.
    15. Sodhi, ManMohan S. & Tang, Christopher S., 2009. "Modeling supply-chain planning under demand uncertainty using stochastic programming: A survey motivated by asset-liability management," International Journal of Production Economics, Elsevier, vol. 121(2), pages 728-738, October.
    16. Silvia Araújo dos Reis & José Eugenio Leal & Antônio Márcio Tavares Thomé, 2023. "A Two-Stage Stochastic Linear Programming Model for Tactical Planning in the Soybean Supply Chain," Logistics, MDPI, vol. 7(3), pages 1-26, August.
    17. Yousra Tourki & Jeffrey Keisler & Igor Linkov, 2013. "Scenario analysis: a review of methods and applications for engineering and environmental systems," Environment Systems and Decisions, Springer, vol. 33(1), pages 3-20, March.
    18. Boris Defourny & Damien Ernst & Louis Wehenkel, 2013. "Scenario Trees and Policy Selection for Multistage Stochastic Programming Using Machine Learning," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 488-501, August.
    19. Mitra, Sovan & Lim, Sungmook & Karathanasopoulos, Andreas, 2019. "Regression based scenario generation: Applications for performance management," Operations Research Perspectives, Elsevier, vol. 6(C).
    20. Tiberius, Victor & Siglow, Caroline & Sendra-García, Javier, 2020. "Scenarios in business and management: The current stock and research opportunities," Journal of Business Research, Elsevier, vol. 121(C), pages 235-242.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:285:y:2020:i:1:p:106-119. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.