Adaptive sampling strategies for risk-averse stochastic optimization with constraints

被引:5
|
作者
Beiser, Florian [1 ]
Keith, Brendan [2 ]
Urbainczyk, Simon [3 ,4 ]
Wohlmuth, Barbara [5 ]
机构
[1] SINTEF Digital, Math & Cybernet, Forskningsveien 1, N-0373 Oslo, Norway
[2] Brown Univ, Div Appl Math, Providence, RI 02912 USA
[3] Heriot Watt Univ, Maxwell Inst Math Sci, Edinburgh EH14 4AS, Scotland
[4] Heriot Watt Univ, Dept Actuarial Math & Stat, Edinburgh EH14 4AS, Scotland
[5] Tech Univ Munich, Dept Math, Boltzmannstr 3, D-80333 Munich, Germany
基金
奥地利科学基金会; 美国国家科学基金会; 欧盟地平线“2020”;
关键词
stochastic optimization; sample size selection; constrained optimization; portfolio optimization; shape optimization; ALGORITHMS; DESIGN;
D O I
10.1093/imanum/drac083
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We introduce adaptive sampling methods for stochastic programs with deterministic constraints. First, we propose and analyze a variant of the stochastic projected gradient method, where the sample size used to approximate the reduced gradient is determined on-the-fly and updated adaptively. This method is applicable to a broad class of expectation-based risk measures, and leads to a significant reduction in the individual gradient evaluations used to estimate the objective function gradient. Numerical experiments with expected risk minimization and conditional value-at-risk minimization support this conclusion, and demonstrate practical performance and efficacy for both risk-neutral and risk-averse problems. Second, we propose an SQP-type method based on similar adaptive sampling principles. The benefits of this method are demonstrated in a simplified engineering design application, featuring risk-averse shape optimization of a steel shell structure subject to uncertain loading conditions and model uncertainty.
引用
收藏
页码:3729 / 3765
页数:37
相关论文
共 50 条
  • [1] Adaptive Sampling for Stochastic Risk-Averse Learning
    Curi, Sebastian
    Levy, Kfir Y.
    Jegelka, Stefanie
    Krause, Andreas
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS (NEURIPS 2020), 2020, 33
  • [2] Duality between coherent risk measures and stochastic dominance constraints in risk-averse optimization
    Dentcheva, Darinka
    Rusczynski, Andrzej
    [J]. PACIFIC JOURNAL OF OPTIMIZATION, 2008, 4 (03): : 433 - 446
  • [3] APPROXIMATION ALGORITHMS FOR STOCHASTIC AND RISK-AVERSE OPTIMIZATION
    Byrka, Jaroslaw
    Srinivasan, Aravind
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (01) : 44 - 63
  • [4] Approximation Algorithms for Stochastic and Risk-Averse Optimization
    Srinivasan, Aravind
    [J]. PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 1305 - 1313
  • [5] Risk-Averse Bargaining in a Stochastic Optimization Context
    Gutjahr, Walter J.
    Kovacevic, Raimund M.
    Wozabal, David
    [J]. M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, 2022, 25 (01) : 323 - 340
  • [6] Martingale characterizations of risk-averse stochastic optimization problems
    Pichler, Alois
    Schlotter, Ruben
    [J]. MATHEMATICAL PROGRAMMING, 2020, 181 (02) : 377 - 403
  • [7] Multilevel Optimization Modeling for Risk-Averse Stochastic Programming
    Eckstein, Jonathan
    Eskandani, Deniz
    Fan, Jingnan
    [J]. INFORMS JOURNAL ON COMPUTING, 2016, 28 (01) : 112 - 128
  • [8] Martingale characterizations of risk-averse stochastic optimization problems
    Alois Pichler
    Ruben Schlotter
    [J]. Mathematical Programming, 2020, 181 : 377 - 403
  • [9] Robust stochastic dominance and its application to risk-averse optimization
    Dentcheva, Darinka
    Ruszczynski, Andrzej
    [J]. MATHEMATICAL PROGRAMMING, 2010, 123 (01) : 85 - 100
  • [10] Robust stochastic dominance and its application to risk-averse optimization
    Darinka Dentcheva
    Andrzej Ruszczyński
    [J]. Mathematical Programming, 2010, 123 : 85 - 100