An Empirical Quantile Estimation Approach for Chance-Constrained Nonlinear Optimization Problems

被引:0
|
作者
Luo, Fengqiao [1 ]
Larson, Jeffrey [2 ]
机构
[1] Uber Technol, San Francisco, CA 94158 USA
[2] Argonne Natl Lab, Math & Comp Sci Div, Lemont, IL USA
关键词
Chance constraints; Quantile constraints; Empirical quantile process; Finite-difference approximation; Probabilistic augmented Lagrangian method; PROBABILITY FUNCTIONS; APPROXIMATION APPROACH; CONVEX-PROGRAMS; DERIVATIVES; ALGORITHMS; FORMULAS; SETS;
D O I
10.1007/s10957-024-02532-0
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We investigate an empirical quantile estimation approach to solve chance-constrained nonlinear optimization problems. Our approach is based on the reformulation of the chance constraint as an equivalent quantile constraint to provide stronger signals on the gradient. In this approach, the value of the quantile function is estimated empirically from samples drawn from the random parameters, and the gradient of the quantile function is estimated via a finite-difference approximation on top of the quantile-function-value estimation. We establish a convergence theory of this approach within the framework of an augmented Lagrangian method for solving general nonlinear constrained optimization problems. The foundation of the convergence analysis is a concentration property of the empirical quantile process, and the analysis is divided based on whether or not the quantile function is differentiable. In contrast to the sampling-and-smoothing approach used in the literature, the method developed in this paper does not involve any smoothing function and hence the quantile-function gradient approximation is easier to implement and there are less accuracy-control parameters to tune. We demonstrate the effectiveness of this approach and compare it with a smoothing method for the quantile-gradient estimation. Numerical investigation shows that the two approaches are competitive for certain problem instances.
引用
收藏
页码:767 / 809
页数:43
相关论文
共 50 条
  • [11] The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
    Stan, Oana
    Sirdey, Renaud
    Carlier, Jacques
    Nace, Dritan
    JOURNAL OF HEURISTICS, 2014, 20 (03) : 261 - 290
  • [12] SOLVING CHANCE-CONSTRAINED PROBLEMS VIA A SMOOTH SAMPLE-BASED NONLINEAR APPROXIMATION
    Pena-Ordieres, Alejandra
    Luedtke, James R.
    Wachter, Andreas
    SIAM JOURNAL ON OPTIMIZATION, 2020, 30 (03) : 2221 - 2250
  • [13] ADAPTIVE PARTITIONING FOR CHANCE-CONSTRAINED PROBLEMS WITH FINITE SUPPORT
    Roland, Marius
    Forel, Alexandre
    Vidal, Thibaut
    SIAM JOURNAL ON OPTIMIZATION, 2025, 35 (01) : 476 - 505
  • [14] Solving the Batch Stochastic Bin Packing Problem in Cloud: A Chance-constrained Optimization Approach
    Yan, Jie
    Lu, Yunlei
    Chen, Liting
    Qin, Si
    Fang, Yixin
    Lin, Qingwei
    Moscibroda, Thomas
    Rajmohan, Saravan
    Zhang, Dongmei
    PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, : 2169 - 2179
  • [15] A sample approximation solution procedure for chance-constrained districting problems
    Baldassarre, Silvia
    Bruno, Giuseppe
    Diglio, Antonio
    Piccolo, Carmela
    COMPUTERS & OPERATIONS RESEARCH, 2023, 160
  • [16] Chance-constrained optimization for nonconvex programs using scenario-based methods
    Yang, Yu
    Sutanto, Christie
    ISA TRANSACTIONS, 2019, 90 : 157 - 168
  • [17] An Adjustable Chance-Constrained Approach for Flexible Ramping Capacity Allocation
    Wang, Zhiwen
    Shen, Chen
    Liu, Feng
    Wang, Jianhui
    Wu, Xiangyu
    IEEE TRANSACTIONS ON SUSTAINABLE ENERGY, 2018, 9 (04) : 1798 - 1811
  • [18] A bundle method for nonsmooth DC programming with application to chance-constrained problems
    W. van Ackooij
    S. Demassey
    P. Javal
    H. Morais
    W. de Oliveira
    B. Swaminathan
    Computational Optimization and Applications, 2021, 78 : 451 - 490
  • [19] A bundle method for nonsmooth DC programming with application to chance-constrained problems
    van Ackooij, W.
    Demassey, S.
    Javal, P.
    Morais, H.
    de Oliveira, W.
    Swaminathan, B.
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2021, 78 (02) : 451 - 490
  • [20] Approximating the chance-constrained capacitated vehicle routing problem with robust optimization
    Karina Thiebaut
    Artur Pessoa
    4OR, 2023, 21 : 513 - 531