Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
480176 | European Journal of Operational Research | 2012 | 10 Pages |
Inspired by the successful applications of the stochastic optimization with second order stochastic dominance (SSD) model in portfolio optimization, we study new numerical methods for a general SSD model where the underlying functions are not necessarily linear. Specifically, we penalize the SSD constraints to the objective under Slater’s constraint qualification and then apply the well known stochastic approximation (SA) method and the level function method to solve the penalized problem. Both methods are iterative: the former requires to calculate an approximate subgradient of the objective function of the penalized problem at each iterate while the latter requires to calculate a subgradient. Under some moderate conditions, we show that w.p.1 the sequence of approximated solutions generated by the SA method converges to an optimal solution of the true problem. As for the level function method, the convergence is deterministic and in some cases we are able to estimate the number of iterations for a given precision. Both methods are applied to portfolio optimization problem where the return functions are not necessarily linear and some numerical test results are reported.
► We penalize second order stochastic dominance (SSD) constraint to the objective. ► We apply stochastic approximation (SA) algorithm and level function (LF) algorithm. ► We consider portfolio optimization problem with nonlinear return functions. ► Tests show that the LF algorithm performs better than the SA algorithm. ► The proposed portfolio optimization model performs better than the Markowitz model.