Robust Stochastic Optimization With Convex Risk Measures: A Discretized Subgradient Scheme
MetadataShow full item record
Funding and Sponsorship
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.
Showing items related by title, author, creator and subject.
Li, J.; Li, G.; Wu, Z.; Wu, Changzhi (2016)© 2016 Springer-Verlag Berlin HeidelbergThis paper considers a distributed optimization problem encountered in a time-varying multi-agent network, where each agent has local access to its convex objective function, and ...
Ling, A.; Sun, Jie; Xiu, N.; Yang, X. (2017)We study a two-stage stochastic linear optimization problem where the recourse function is risk-averse rather than risk neutral. In particular, we consider the mean-conditional value-at-risk objective function in the ...
Tseng, Chien H. (1999)The design of envelope-constrained (EC) filters is considered for the time-domain synthesis of filters for signal processing problems. The objective is to achieve minimal noise enhancement where the shape of the filter ...