In this contribution we propose a dynamic tracking error problem and we consider the problem of monitoring at discrete point the shortfall of the portfolio below a set of given reference levels of wealth. We formulate and solve the resulting dynamic optimization problem using stochastic...

A fast method based on coordinate-wise descent algorithms is developed to solve portfolio optimization problems in which asset weights are constrained by Lq norms for 1=q=2. The method is first applied to solve a minimum variance portfolio (mvp) optimization problem in which asset weights are...

We consider the problem of choosing an optimal portfolio, assuming the asset returns have a Gaussian mixture (GM) distribution, with the objective of maximizing expected exponential utility. In this paper we show that this problem is convex, and readily solved exactly using domain-specific...

We define a regularized variant of the Dual Dynamic Programming algorithm called REDDP (REgularized Dual Dynamic Programming) to solve nonlinear dynamic programming equations. We extend the algorithm to solve nonlinear stochastic dynamic programming equations. The corresponding algorithm, called...

We revisit the question whether commodities should be included in investors' portfolios. We employ for the first time a stochastic dominance efficiency (SDE) approach to construct optimal portfolios with and without commodities and we evaluate their comparative performance. SDE circumvents the...