ABSTRACT This paper is devoted to the analysis of a discrete time dynamic programming algorithm %for the numerical solution of an optimal asset-liability management model with transaction costs and in presence of constraints. By exploiting the financial properties of the model, we propose a new approximation method for the classical Dynamic Programming algorithm. The regularity of the value function is used to estimate the global error introduced by the numerical procedure and to prove a convergence result.
Optimal Asset-Liability Management with Constraints: A Dynamic Programming Approach
PAPI M;
2006-01-01
Abstract
ABSTRACT This paper is devoted to the analysis of a discrete time dynamic programming algorithm %for the numerical solution of an optimal asset-liability management model with transaction costs and in presence of constraints. By exploiting the financial properties of the model, we propose a new approximation method for the classical Dynamic Programming algorithm. The regularity of the value function is used to estimate the global error introduced by the numerical procedure and to prove a convergence result.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.