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] A polynomial approximation-based approach for chance-constrained optimization
    Chen, Lijian
    OPTIMIZATION METHODS & SOFTWARE, 2019, 34 (01): : 115 - 138
  • [22] The portfolio selection problems with chance-constrained
    Tang, WS
    Han, QH
    Li, GQ
    2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE, 2002, : 2674 - 2679
  • [23] Robust optimization approach for a chance-constrained binary knapsack problem
    Jinil Han
    Kyungsik Lee
    Chungmok Lee
    Ki-Seok Choi
    Sungsoo Park
    Mathematical Programming, 2016, 157 : 277 - 296
  • [24] Robust optimization approach for a chance-constrained binary knapsack problem
    Han, Jinil
    Lee, Kyungsik
    Lee, Chungmok
    Choi, Ki-Seok
    Park, Sungsoo
    MATHEMATICAL PROGRAMMING, 2016, 157 (01) : 277 - 296
  • [25] Solution of Chance-Constrained Mixed-Integer Nonlinear Programming Problems
    Esche, Erik
    Mueller, David
    Werk, Sebastian
    Grossmann, Ignacio E.
    Wozny, Guenter
    26TH EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING (ESCAPE), PT A, 2016, 38A : 91 - 96
  • [26] Concentration of Measure for Chance-Constrained Optimization
    Soudjani, Sadegh
    Majumdar, Rupak
    IFAC PAPERSONLINE, 2018, 51 (16): : 277 - 282
  • [27] 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
  • [28] Optimization of Chance-Constrained Submodular Functions
    Doerr, Benjamin
    Doerr, Carola
    Neumann, Aneta
    Neumann, Frank
    Sutton, Andrew M.
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 1460 - 1467
  • [30] 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