This paper develops an approximate closed-form optimal portfolio allocation formula for a spot asset whose variance follows a GARCH(1,1) process. We consider an investor with constant relative risk aversion (CRRA) utility who wants to maximize the expected utility from terminal wealth under a...

An optimization method is developed for constructing investment portfolios which stochastically dominate a given benchmark for all decreasing absolute risk-averse investors, using Quadratic Programming. The method is applied to standard data sets of historical returns of equity price reversal...

Portfolio optimization literature has come quite far in the decades since the first publication, and many modern models are formulated using second-order cone constraints and take discrete decisions into consideration. In this study, we consider both single-period and multi-period portfolio...

We study dynamic mean-variance optimization problems with multiple priors. We introduce two types of multiple priors, the priors for expected returns and the priors for covariances. Our framework suggests that the global minimum-variance portfolio is optimal when the investor strongly doubts the...

Dynamic programming is the essential tool in dynamic economic analysis. Problems such as portfolio allocation for individuals and optimal economic growth are typical examples. Numerical methods typically approximate the value function. Recent work has focused on making numerical methods more...

Average Value-at-Risk (AVaR) is a potential alternative to Value-at-Risk in the financial regulation of banking and insurance institutions. To understand how AVaR influences a company's investment behavior, we study portfolio optimization under the AVaR constraint. Our main contribution is to...

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...

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...