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 条
  • [1] On the Quantile Cut Closure of Chance-Constrained Problems
    Xie, Weijun
    Ahmed, Shabbir
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2016, 2016, 9682 : 398 - 409
  • [2] DUALITY FOR LINEAR CHANCE-CONSTRAINED OPTIMIZATION PROBLEMS
    Bot, Radu Ioan
    Lorenz, Nicole
    Wanka, Gert
    JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, 2010, 47 (01) : 17 - 28
  • [3] Nonlinear chance-constrained problems with applications to hydro scheduling
    Andrea Lodi
    Enrico Malaguti
    Giacomo Nannicini
    Dimitri Thomopulos
    Mathematical Programming, 2022, 191 : 405 - 444
  • [4] Nonlinear chance-constrained problems with applications to hydro scheduling
    Lodi, Andrea
    Malaguti, Enrico
    Nannicini, Giacomo
    Thomopulos, Dimitri
    MATHEMATICAL PROGRAMMING, 2022, 191 (01) : 405 - 444
  • [5] On quantile cuts and their closure for chance constrained optimization problems
    Xie, Weijun
    Ahmed, Shabbir
    MATHEMATICAL PROGRAMMING, 2018, 172 (1-2) : 621 - 646
  • [6] A Randomised Approach to Multiple Chance-Constrained Problems: An Application to Flood Avoidance
    Nasir, Hasan Arshad
    Care, Algo
    Weyer, Erik
    2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 6216 - 6221
  • [7] The Value of Drilling-A Chance-Constrained Optimization Approach
    Jeuken, Rick
    Forbes, Michael
    MINING METALLURGY & EXPLORATION, 2024, : 2279 - 2289
  • [8] Chance-Constrained Trajectory Optimization for Safe Exploration and Learning of Nonlinear Systems
    Nakka, Yashwanth Kumar
    Liu, Anqi
    Shi, Guanya
    Anandkumar, Anima
    Yue, Yisong
    Chung, Soon-Jo
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2021, 6 (02) : 389 - 396
  • [9] Inner Moreau Envelope of Nonsmooth Conic Chance-Constrained Optimization Problems
    van Ackooij, Wim
    Perez-Aros, Pedro
    Soto, Claudia
    Vilches, Emilio
    MATHEMATICS OF OPERATIONS RESEARCH, 2024, 49 (03) : 1419 - 1451
  • [10] TRACTABLE ALGORITHMS FOR CHANCE-CONSTRAINED COMBINATORIAL PROBLEMS
    Klopfenstein, Olivier
    RAIRO-OPERATIONS RESEARCH, 2009, 43 (02) : 157 - 186