Approximate Dynamic Programming-Based Dynamic Portfolio Optimization for Constrained Index Tracking


Recently, the constrained index tracking problem, in which the task of trading a set of stocks is performed so as to closely follow an index value under some constraints, has often been considered as an important application domain for control theory. Because this problem can be conveniently viewed and formulated as an optimal decision-making problem in a highly uncertain and stochastic environment, approaches based on stochastic optimal control methods are particularly pertinent. Since stochastic optimal control problems cannot be solved exactly except in very simple cases, approximations are required in most practical problems to obtain good suboptimal policies. In this paper, we present a procedure for finding a suboptimal solution to the constrained index tracking problem based on approximate dynamic programming. Illustrative simulation results show that this procedure works well when applied to a set of real financial market data.

DOI: 10.5391/IJFIS.2013.13.1.19

Extracted Key Phrases

9 Figures and Tables

Cite this paper

@article{Park2013ApproximateDP, title={Approximate Dynamic Programming-Based Dynamic Portfolio Optimization for Constrained Index Tracking}, author={Jooyoung Park and Dong-Su Yang and Kyungwook Park}, journal={Int. J. Fuzzy Logic and Intelligent Systems}, year={2013}, volume={13}, pages={19-30} }