We propose a dynamic programming algorithm for the one-dimensional Fused Lasso Signal Approximator (FLSA). The proposed algorithm has a linear running time in the worst case. A similar approach is ...

This is a preview. Log in through your library . Abstract In this paper, we develop an efficient algorithm to value options under discrete-time GARCH processes. We propose a procedure based on dynamic ...