Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization
Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization
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.
376-385
Meskarian, Rudabeh
932d1dac-784b-4f24-bdda-5ea34a16d8a2
Fliege, Joerg
54978787-a271-4f70-8494-3c701c893d98
Xu, Huifu
d3200e0b-ad1d-4cf7-81aa-48f07fb1f8f5
January 2012
Meskarian, Rudabeh
932d1dac-784b-4f24-bdda-5ea34a16d8a2
Fliege, Joerg
54978787-a271-4f70-8494-3c701c893d98
Xu, Huifu
d3200e0b-ad1d-4cf7-81aa-48f07fb1f8f5
Meskarian, Rudabeh, Fliege, Joerg and Xu, Huifu
(2012)
Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization.
European Journal of Operational Research, 216 (2), .
(doi:10.1016/j.ejor.2011.07.044).
Abstract
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.
This record has no associated files available for download.
More information
Published date: January 2012
Organisations:
Operational Research
Identifiers
Local EPrints ID: 177365
URI: http://eprints.soton.ac.uk/id/eprint/177365
ISSN: 0377-2217
PURE UUID: ef7f7c14-ffb6-424e-adfa-81e342a852e8
Catalogue record
Date deposited: 17 Mar 2011 09:15
Last modified: 14 Mar 2024 02:53
Export record
Altmetrics
Contributors
Author:
Rudabeh Meskarian
Author:
Huifu Xu
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics