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 条
  • [21] Dynamic Chance-Constrained Optimization under Uncertainty on Reduced Parameter Sets
    Mueller, David
    Esche, Erik
    Werk, Sebastian
    Wozny, Guenter
    12TH INTERNATIONAL SYMPOSIUM ON PROCESS SYSTEMS ENGINEERING (PSE) AND 25TH EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING (ESCAPE), PT A, 2015, 37 : 725 - 730
  • [22] Multi-Area Reserve Dimensioning Using Chance-Constrained Optimization
    Papavasiliou, Anthony
    Bouso, Alberte
    Apelfrojd, Senad
    Wik, Ellika
    Gueuning, Thomas
    Langer, Yves
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2022, 37 (05) : 3982 - 3994
  • [23] Approximating the chance-constrained capacitated vehicle routing problem with robust optimization
    Thiebaut, Karina
    Pessoa, Artur
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2023, 21 (03): : 513 - 531
  • [24] DERIVATIVE-FREE APPROACHES FOR CHANCE-CONSTRAINED PROBLEMS WITH RIGHT-HAND SIDE UNCERTAINTY
    DE Oliveira, W.
    SIAM JOURNAL ON OPTIMIZATION, 2025, 35 (01) : 1 - 27
  • [25] Convex relaxations of chance constrained optimization problems
    Shabbir Ahmed
    Optimization Letters, 2014, 8 : 1 - 12
  • [26] Chance-Constrained AC Optimal Power Flow: A Polynomial Chaos Approach
    Muhlpfordt, Tillmann
    Roald, Line
    Hagenmeyer, Veit
    Faulwasser, Timm
    Misra, Sidhant
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2019, 34 (06) : 4806 - 4816
  • [27] An Efficient Primal-Dual Approach to Chance-Constrained Economic Dispatch
    Martinez, Gabriela
    Zhang, Yu
    Giannakis, Georgios B.
    2014 NORTH AMERICAN POWER SYMPOSIUM (NAPS), 2014,
  • [28] Convex relaxations of chance constrained optimization problems
    Ahmed, Shabbir
    OPTIMIZATION LETTERS, 2014, 8 (01) : 1 - 12
  • [29] An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs
    Luedtke, James
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2010, 6080 : 271 - 284
  • [30] A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs
    Kannan, Rohit
    Luedtke, James R.
    MATHEMATICAL PROGRAMMING COMPUTATION, 2021, 13 (04) : 705 - 751