arrow
Return

A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs

delete2021-01-23
delete10
delete
OA
AI
R
Rohit Kannan *
J
James Luedtke
DOI:10.1007/s12532-020-00199-ydelete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
We propose a stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs. Our approach is based on a bi-objective viewpoint of chance-constrained programs that seeks solutions on the efficient frontier of optimal objective value versus risk of constraints violation. To this end, we construct a reformulated problem whose objective is to minimize the probability of constraints violation subject to deterministic convex constraints (which includes a bound on the objective function value). We adapt existing smoothing-based approaches for chance-constrained problems to derive a convergent sequence of smooth approximations of our reformulated problem, and apply a projected stochastic subgradient algorithm to solve it. In contrast with exterior sampling-based approaches (such as sample average approximation) that approximate the original chance-constrained program with one having finite support, our proposal converges to stationary solutions of a smooth approximation of the original problem, thereby avoiding poor local solutions that may be an artefact of a fixed sample. Our proposal also includes a tailored implementation of the smoothing-based approach that chooses key algorithmic parameters based on problem data. Computational results on four test problems from the literature indicate that our proposed approach can efficiently determine good approximations of the efficient frontier.
Keywords:
Stochastic approximation
Chance constraints
Efficient frontier
Stochastic subgradient
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Mathematical Programming Computation cover
Mathematical Programming Computation
IF:
3.6
Papers:
197
Citations:
1.9K

Organization

University of Wisconsin System cover
University of Wisconsin System
Scholars:
6.7W
Papers: 5.8W
Citations: 382