Solving chance-constrained problems via a smooth sample-based nonlinear approximation
From MaRDI portal
Abstract: We introduce a new method for solving nonlinear continuous optimization problems with chance constraints. Our method is based on a reformulation of the probabilistic constraint as a quantile function. The quantile function is approximated via a differentiable sample average approximation. We provide theoretical statistical guarantees of the approximation, and illustrate empirically that the reformulation can be directly used by standard nonlinear optimization solvers in the case of single chance constraints. Furthermore, we propose an SQP-type trust-region method to solve instances with joint chance constraints. We demonstrate the performance of the method on several problems, and show that it scales well with the sample size and that the smoothing can be used to counteract the bias in the chance constraint approximation induced by the sample approximation.
Recommendations
- Partial sample average approximation method for chance constrained problems
- An inner-outer approximation approach to chance constrained optimization
- A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs
- Nonlinear chance constrained problems: optimality conditions, regularization and solvers
- A smoothing function approach to joint chance-constrained programs
Cites work
- (Sub-)differentiability of probability functions with elliptical distributions
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- A critical note on empirical (Sample average, Monte Carlo) approximation of solutions to chance constrained programs
- A nonparametric approach to calculating value-at-risk
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A sequential algorithm for solving nonlinear optimization problems with chance constraints
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- An inner-outer approximation approach to chance constrained optimization
- An integer programming approach for linear programs with probabilistic constraints
- Chance-Constrained Binary Packing Problems
- Chance-constrained optimal power flow: risk-aware network control under uncertainty
- Computation of multivariate normal and t probabilities
- Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems
- Convex Approximations of Chance Constrained Programs
- Gradient Formulae for Nonlinear Probabilistic Constraints with Gaussian and Gaussian-Like Distributions
- scientific article; zbMATH DE number 1688594 (Why is no real title available?)
- scientific article; zbMATH DE number 4083369 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Joint chance constrained programming for hydro reservoir management
- Kernel density estimation revisited
- Lectures on stochastic programming. Modeling and theory.
- On probabilistic capacity maximization in a stationary gas network
- On the numerical solution of jointly chance constrained problems
- Optimization of a continuous distillation process under random inflow rate.
- Probabilistic constraints via SQP solver: application to a renewable energy management problem
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Probability Inequalities for Sums of Bounded Random Variables
- Sample average approximation method for chance constrained programming: Theory and applications
- Scenario approximations of chance constraints
- Sequential convex approximations to joint chance constrained programs: A Monte Carlo approach
- Structural properties of linear probabilistic constraints
- Subdifferential characterization of probability functions under Gaussian distribution
- Subroutines for computing normal probabilities of sets -- computer experiences
- Trust Region Methods
- Uncertain convex programs: randomized solutions and confidence levels
Cited in
(28)- Statistical learning for probability-constrained stochastic optimal control
- A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs
- A smooth approximation approach for optimization with probabilistic constraints based on sigmoid function
- Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs
- Partial sample average approximation method for chance constrained problems
- Gradients and subgradients of buffered failure probability
- Derivatives of probability functions: unions of polyhedra and elliptical distributions
- Nonlinear chance constrained problems: optimality conditions, regularization and solvers
- A sequential algorithm for solving nonlinear optimization problems with chance constraints
- A polynomial approximation-based approach for chance-constrained optimization
- Method for solving chance constrained optimal control problems using biased kernel density estimators
- ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs
- Optimization under rare chance constraints
- Data-Driven Approximation of Contextual Chance-Constrained Stochastic Programs
- On data-driven chance constraint learning for mixed-integer optimization problems
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- Approximate methods for solving chance-constrained linear programs in probability measure space
- Bayesian Joint Chance Constrained Optimization: Approximations and Statistical Consistency
- A D.C. approximation approach for optimization with probabilistic constraints based on Chen-Harker-Kanzow-Smale smooth plus function
- Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective
- Pontryagin's principle for some probabilistic control problems
- An empirical quantile estimation approach for chance-constrained nonlinear optimization problems
- Optimal control under uncertainty with joint chance state constraints: almost-everywhere bounds, variance reduction, and application to (bi)linear elliptic PDEs
- Probabilistic reachable sets of stochastic nonlinear systems with contextual uncertainties
- Approximating inequality systems within probability functions: studying implications for problems and consistency of first-order information
- Probability functions, differentiability, arbitrary laws and mixtures of ellipticals
- A software framework for stochastic model predictive control of nonlinear continuous-time systems (GRAMPC-S)
- Chance-constrained reachability analysis for data-driven predictive control of unknown nonlinear systems.
This page was built for publication: Solving chance-constrained problems via a smooth sample-based nonlinear approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116556)
