# American Institute of Mathematical Sciences

January  2021, 17(1): 81-99. doi: 10.3934/jimo.2019100

## Robust stochastic optimization with convex risk measures: A discretized subgradient scheme

 1 School of Statistics and Mathematics, Shanghai Lixin University of Accounting and Fiance, China 2 School of Mathematical Science, Chongqing Normal University, China 3 Faculty of Science and Engineering, Curtin University, Perth, Australia

* Corresponding author

Received  March 2018 Revised  July 2018 Published  September 2019

Fund Project: This work is partially supported by Grants 11401384, 11671029, 71631008 and B16002 of National Natural Science Foundation of China and by Grant DP160102819 of Australian Research Council

We study the distributionally robust stochastic optimization problem within a general framework of risk measures, in which the ambiguity set is described by a spectrum of practically used probability distribution constraints such as bounds on mean-deviation and entropic value-at-risk. We show that a subgradient of the objective function can be obtained by solving a finite-dimensional optimization problem, which facilitates subgradient-type algorithms for solving the robust stochastic optimization problem. We develop an algorithm for two-stage robust stochastic programming with conditional value at risk measure. A numerical example is presented to show the effectiveness of the proposed method.

Citation: Haodong Yu, Jie Sun. Robust stochastic optimization with convex risk measures: A discretized subgradient scheme. Journal of Industrial & Management Optimization, 2021, 17 (1) : 81-99. doi: 10.3934/jimo.2019100
##### References:

show all references

##### References:
parameters of the test problem
 $w$(Wrench) $p$(Plier) $x$: Steel A(lbs.) 1.5 1 $y$: Steel B(lbs.) 1 2 Molding Machine (hours) 1 1 Assembly Machine (hours) .3 .5 Contribution to Earnings (＄/1000 units) 130 100
 $w$(Wrench) $p$(Plier) $x$: Steel A(lbs.) 1.5 1 $y$: Steel B(lbs.) 1 2 Molding Machine (hours) 1 1 Assembly Machine (hours) .3 .5 Contribution to Earnings (＄/1000 units) 130 100
combined distribution of $h$
 $h_2$ $h_1$ 21000 25000 8000 0.25 0.25 10000 0.25 0.25
 $h_2$ $h_1$ 21000 25000 8000 0.25 0.25 10000 0.25 0.25
possible values of h
 $i$ 1 2 3 4 $h_{1i}$ 21000 21000 25000 25000 $h_{2i}$ 8000 10000 8000 10000
 $i$ 1 2 3 4 $h_{1i}$ 21000 21000 25000 25000 $h_{2i}$ 8000 10000 8000 10000
production plans under various scenarios
 $i$ 1 2 3 4 $w_i$ 7988 9969 8000 9969 $p_i$ 77 10 27 10
 $i$ 1 2 3 4 $w_i$ 7988 9969 8000 9969 $p_i$ 77 10 27 10
worst-case distribution of $h$
 Pro 0.5 0.0134 0.0539 0.0006 0.4321 $h_1$ 22355 22216 21008 22239 24021 $h_2$ 8000 10000 10000 10000 10000
 Pro 0.5 0.0134 0.0539 0.0006 0.4321 $h_1$ 22355 22216 21008 22239 24021 $h_2$ 8000 10000 10000 10000 10000
 [1] Ripeng Huang, Shaojian Qu, Xiaoguang Yang, Zhimin Liu. Multi-stage distributionally robust optimization with risk aversion. Journal of Industrial & Management Optimization, 2021, 17 (1) : 233-259. doi: 10.3934/jimo.2019109 [2] Hui Gao, Jian Lv, Xiaoliang Wang, Liping Pang. An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information. Journal of Industrial & Management Optimization, 2021, 17 (2) : 805-825. doi: 10.3934/jimo.2019135 [3] Lekbir Afraites, Chorouk Masnaoui, Mourad Nachaoui. Shape optimization method for an inverse geometric source problem and stability at critical shape. Discrete & Continuous Dynamical Systems - S, 2021  doi: 10.3934/dcdss.2021006 [4] Bing Yu, Lei Zhang. Global optimization-based dimer method for finding saddle points. Discrete & Continuous Dynamical Systems - B, 2021, 26 (1) : 741-753. doi: 10.3934/dcdsb.2020139 [5] C. J. Price. A modified Nelder-Mead barrier method for constrained optimization. Numerical Algebra, Control & Optimization, 2020  doi: 10.3934/naco.2020058 [6] Hedy Attouch, Aïcha Balhag, Zaki Chbani, Hassan Riahi. Fast convex optimization via inertial dynamics combining viscous and Hessian-driven damping with time rescaling. Evolution Equations & Control Theory, 2021  doi: 10.3934/eect.2021010 [7] Alberto Bressan, Sondre Tesdal Galtung. A 2-dimensional shape optimization problem for tree branches. Networks & Heterogeneous Media, 2020  doi: 10.3934/nhm.2020031 [8] Yasmine Cherfaoui, Mustapha Moulaï. Biobjective optimization over the efficient set of multiobjective integer programming problem. Journal of Industrial & Management Optimization, 2021, 17 (1) : 117-131. doi: 10.3934/jimo.2019102 [9] Claudia Lederman, Noemi Wolanski. An optimization problem with volume constraint for an inhomogeneous operator with nonstandard growth. Discrete & Continuous Dynamical Systems - A, 2020  doi: 10.3934/dcds.2020391 [10] Ying Liu, Yanping Chen, Yunqing Huang, Yang Wang. Two-grid method for semiconductor device problem by mixed finite element method and characteristics finite element method. Electronic Research Archive, 2021, 29 (1) : 1859-1880. doi: 10.3934/era.2020095 [11] Guo Zhou, Yongquan Zhou, Ruxin Zhao. Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem. Journal of Industrial & Management Optimization, 2021, 17 (2) : 533-548. doi: 10.3934/jimo.2019122 [12] Min Xi, Wenyu Sun, Jun Chen. Survey of derivative-free optimization. Numerical Algebra, Control & Optimization, 2020, 10 (4) : 537-555. doi: 10.3934/naco.2020050 [13] Predrag S. Stanimirović, Branislav Ivanov, Haifeng Ma, Dijana Mosić. A survey of gradient methods for solving nonlinear optimization. Electronic Research Archive, 2020, 28 (4) : 1573-1624. doi: 10.3934/era.2020115 [14] Xinpeng Wang, Bingo Wing-Kuen Ling, Wei-Chao Kuang, Zhijing Yang. Orthogonal intrinsic mode functions via optimization approach. Journal of Industrial & Management Optimization, 2021, 17 (1) : 51-66. doi: 10.3934/jimo.2019098 [15] Wolfgang Riedl, Robert Baier, Matthias Gerdts. Optimization-based subdivision algorithm for reachable sets. Journal of Computational Dynamics, 2021, 8 (1) : 99-130. doi: 10.3934/jcd.2021005 [16] Manxue You, Shengjie Li. Perturbation of Image and conjugate duality for vector optimization. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020176 [17] Marek Macák, Róbert Čunderlík, Karol Mikula, Zuzana Minarechová. Computational optimization in solving the geodetic boundary value problems. Discrete & Continuous Dynamical Systems - S, 2021, 14 (3) : 987-999. doi: 10.3934/dcdss.2020381 [18] Martin Heida, Stefan Neukamm, Mario Varga. Stochastic homogenization of $\Lambda$-convex gradient flows. Discrete & Continuous Dynamical Systems - S, 2021, 14 (1) : 427-453. doi: 10.3934/dcdss.2020328 [19] Li-Bin Liu, Ying Liang, Jian Zhang, Xiaobing Bao. A robust adaptive grid method for singularly perturbed Burger-Huxley equations. Electronic Research Archive, 2020, 28 (4) : 1439-1457. doi: 10.3934/era.2020076 [20] Lateef Olakunle Jolaoso, Maggie Aphane. Bregman subgradient extragradient method with monotone self-adjustment stepsize for solving pseudo-monotone variational inequalities and fixed point problems. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020178

2019 Impact Factor: 1.366

## Tools

Article outline

Figures and Tables