IIE Transactions · 2012 · 30 citations · 21 references
Natural SciencesComputer ScienceMathematicsOptimizationProbability TheoryStochastic ModelingApproximation AlgorithmsMonte Carlo MethodsMonte Carlo SimulationSimulation MethodsStochastic OptimizationStochastic ProgrammingChance ConstraintsChance-constrained ProgrammingContinuous Random VariablesConvex FunctionsDiscrete Random VariablesProbabilistic ProgrammingSequential Convex OptimizationSequential Convex Programming
This article studies Joint Chance-Constrained Programs (JCCPs). JCCPs are often non-convex and non-smooth and thus are generally challenging to solve. This article proposes a logarithm-sum-exponential smoothing technique to approximate a joint chance constraint by the difference of two smooth convex functions, and uses a sequential convex approximation algorithm, coupled with a Monte Carlo method, to solve the approximation. This approach is called a smooth Monte Carlo approach in this article. It is shown that the proposed approach is capable of handling both smooth and non-smooth JCCPs where the random variables can be either continuous, discrete, or mixed. The numerical experiments further confirm these findings.
21
Optimization of conditional value-at-risk
R. T. Rockafellar, Stan Uryasev · The Journal of Risk · 2000 · 6.5K citations
Business, Finance, Risk Management +17
Nonlinear programming: theory and algorithms
Computers & Operations Research · 1993 · 5.8K citations
Conditional value-at-risk for general loss distributions
R. T. Rockafellar, Stan Uryasev · Journal of Banking & Finance · 2002 · 3.7K citations
Business, Finance, Risk Management +14
Smooth minimization of non-smooth functions
Yu. Nesterov · Mathematical Programming · 2004 · 2.6K citations