-

 

 

 




Optimization Online





 

Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation

Alejandra Pena-Ordieres (alejandra.pena***at***u.northwestern.edu)
James Luedtke (jrluedt1***at***wisc.edu)
Andreas Waechter (andreas.waechter***at***northwestern.edu)

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 Sl1QP-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.

Keywords: chance constraints, nonlinear optimization, quantile function, sample average approximation, smoothing, sequential quadratic programming, trust region

Category 1: Stochastic Programming

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: May 2019

Download: [PDF]

Entry Submitted: 05/15/2019
Entry Accepted: 05/15/2019
Entry Last Modified: 05/16/2019

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society