A smoothing penalized sample average approximation method for stochastic programs with second order stochastic dominance constraints
A smoothing penalized sample average approximation method for stochastic programs with second order stochastic dominance constraints
In this paper, we propose a smoothing penalized sample average approximation (SAA) method for solving a stochastic minimization problem with second-order dominance constraints. The basic idea is to use sample average to approximate the expected values of the underlying random functions and then reformulate the discretized problem as an ordinary nonlinear programming problem with finite number of constraints. An exact penalty function method is proposed to deal with the latter and an elementary smoothing technique is used to tackle the nonsmoothness of the plus function and the exact penalty function. We investigate the convergence of the optimal value obtained from solving the smoothed penalized sample average approximation problem as sample size increases and show that with probability approaching to one at exponential rate with the increase of sample size the optimal value converges to its true counterpart. Some preliminary numerical results are reported.
Read More: http://www.worldscientific.com/doi/abs/10.1142/S0217595913400022
1-25
Sun, Hailin
eee2e5fb-018b-45d4-b599-08209509663c
Xu, Huifu
d3200e0b-ad1d-4cf7-81aa-48f07fb1f8f5
Wang, Yong
a7913cc9-1250-4f71-ab1f-93480043bb6a
June 2013
Sun, Hailin
eee2e5fb-018b-45d4-b599-08209509663c
Xu, Huifu
d3200e0b-ad1d-4cf7-81aa-48f07fb1f8f5
Wang, Yong
a7913cc9-1250-4f71-ab1f-93480043bb6a
Sun, Hailin, Xu, Huifu and Wang, Yong
(2013)
A smoothing penalized sample average approximation method for stochastic programs with second order stochastic dominance constraints.
Asia-Pacific Journal of Operational Research, 30 (3), .
(doi:10.1142/S0217595913400022).
Abstract
In this paper, we propose a smoothing penalized sample average approximation (SAA) method for solving a stochastic minimization problem with second-order dominance constraints. The basic idea is to use sample average to approximate the expected values of the underlying random functions and then reformulate the discretized problem as an ordinary nonlinear programming problem with finite number of constraints. An exact penalty function method is proposed to deal with the latter and an elementary smoothing technique is used to tackle the nonsmoothness of the plus function and the exact penalty function. We investigate the convergence of the optimal value obtained from solving the smoothed penalized sample average approximation problem as sample size increases and show that with probability approaching to one at exponential rate with the increase of sample size the optimal value converges to its true counterpart. Some preliminary numerical results are reported.
Read More: http://www.worldscientific.com/doi/abs/10.1142/S0217595913400022
This record has no associated files available for download.
More information
Published date: June 2013
Organisations:
Operational Research
Identifiers
Local EPrints ID: 390728
URI: http://eprints.soton.ac.uk/id/eprint/390728
ISSN: 0217-5959
PURE UUID: 58a86013-5e6e-49ab-9fef-b5bb04e04f7d
Catalogue record
Date deposited: 06 Apr 2016 14:37
Last modified: 15 Mar 2024 03:15
Export record
Altmetrics
Contributors
Author:
Hailin Sun
Author:
Huifu Xu
Author:
Yong Wang
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