Inner Moreau Envelope of Nonsmooth Conic Chance-Constrained Optimization Problems

被引:0
|
作者
van Ackooij, Wim [1 ]
Perez-Aros, Pedro [2 ]
Soto, Claudia [2 ,3 ]
Vilches, Emilio [2 ]
机构
[1] OSIRIS 7, EDF R&D, F-91120 Palaiseau, France
[2] Univ OHiggins, Inst Ciencias, Rancagua 2820000, Chile
[3] Univ Chile, Dept Ingn Matemat, Santiago 8370456, Chile
关键词
Moreau envelope; probability functions; chance-constrained optimization; convex optimization; PROBABILITY FUNCTIONS; BUNDLE METHODS; CONVEX APPROXIMATIONS; CONVERGENCE ANALYSIS; GRADIENT FORMULAS; INFINITE; SUPREMUM; DIFFERENTIATION; ALGORITHM; PROGRAMS;
D O I
10.1287/moor.2021.0338
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Optimization problems with uncertainty in the constraints occur in many applications. Particularly, probability functions present a natural form to deal with this situation. Nevertheless, in some cases, the resulting probability functions are nonsmooth, which motivates us to propose a regularization employing the Moreau envelope of a scalar representation of the vector inequality. More precisely, we consider a probability function that covers most of the general classes of probabilistic constraints: & phi;(x) � P(& phi;(x, & xi;) & ISIN; -K), where K is a convex cone of a Banach space. The conic inclusion & phi;(x, & xi;) & ISIN; -K represents an abstract system of inequalities, and & xi; is a random vector. We propose a regularization by applying the Moreau envelope to the scalarization of the function & phi;. In this paper, we demonstrate, under mild assumptions, the smoothness of such a regularization and that it satisfies a type of variational convergence to the original probability function. Consequently, when considering an appropriately structured problem involving probabilistic constraints, we can, thus, entail the convergence of the minimizers of the regularized approximate problems to the minimizers of the original problem. Finally, we illustrate our results with examples and applications in the field of (nonsmooth) joint, semidefinite, and probust chance-constrained optimization problems.
引用
收藏
页码:1419 / 1451
页数:33
相关论文
共 50 条
  • [1] DUALITY FOR LINEAR CHANCE-CONSTRAINED OPTIMIZATION PROBLEMS
    Bot, Radu Ioan
    Lorenz, Nicole
    Wanka, Gert
    [J]. JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, 2010, 47 (01) : 17 - 28
  • [2] 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
    [J]. Computational Optimization and Applications, 2021, 78 : 451 - 490
  • [3] 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.
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2021, 78 (02) : 451 - 490
  • [4] Noisy Immune Optimization for Chance-constrained Programming Problems
    Zhang Zhu-hong
    [J]. MEASURING TECHNOLOGY AND MECHATRONICS AUTOMATION, PTS 1 AND 2, 2011, 48-49 : 740 - 744
  • [5] Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities
    Lejeune, Miguel A.
    Margot, Francois
    [J]. OPERATIONS RESEARCH, 2016, 64 (04) : 939 - 957
  • [6] CHANCE-CONSTRAINED METHODS FOR OPTIMIZATION PROBLEMS WITH RANDOM AND FUZZY PARAMETERS
    Yang, Lixing
    [J]. INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2009, 5 (02): : 413 - 422
  • [7] An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems
    Bai, Xiaodi
    Sun, Jie
    Zheng, Xiaojin
    [J]. INFORMS JOURNAL ON COMPUTING, 2021, 33 (03) : 1056 - 1069
  • [8] Chance-Constrained Binary Packing Problems
    Song, Yongjia
    Luedtke, James R.
    Kuecuekyavuz, Simge
    [J]. INFORMS JOURNAL ON COMPUTING, 2014, 26 (04) : 735 - 747
  • [9] The portfolio selection problems with chance-constrained
    Tang, WS
    Han, QH
    Li, GQ
    [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE, 2002, : 2674 - 2679
  • [10] Concentration of Measure for Chance-Constrained Optimization
    Soudjani, Sadegh
    Majumdar, Rupak
    [J]. IFAC PAPERSONLINE, 2018, 51 (16): : 277 - 282