Accurate and Robust Numerical Methods for the Dynamic Portfolio Management Problem

Journal Article (2016)
Author(s)

F. Cong (TU Delft - Numerical Analysis)

CW Oosterlee (Centrum Wiskunde & Informatica (CWI), TU Delft - Numerical Analysis)

Research Group
Numerical Analysis
Copyright
© 2016 F. Cong, C.W. Oosterlee
DOI related publication
https://doi.org/10.1007/s10614-016-9569-0
More Info
expand_more
Publication Year
2016
Language
English
Copyright
© 2016 F. Cong, C.W. Oosterlee
Research Group
Numerical Analysis
Issue number
3
Volume number
49
Pages (from-to)
433-458
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

This paper enhances a well-known dynamic portfolio management algorithm, the BGSS algorithm, proposed by Brandt et al. (Review of Financial Studies, 18(3):831–873, 2005). We equip this algorithm with the components from a recently developed method, the Stochastic Grid Bundling Method (SGBM), for calculating conditional expectations. When solving the first-order conditions for a portfolio optimum, we implement a Taylor series expansion based on a nonlinear decomposition to approximate the utility functions. In the numerical tests, we show that our algorithm is accurate and robust in approximating the optimal investment strategies, which are generated by a new benchmark approach based on the COS method (Fang and Oosterlee, in SIAM Journal of Scientific Computing, 31(2):826–848, 2008).