mlsanityData to 7 Oct 2026

Adaptive sampling strategies for risk-averse stochastic optimization with constraints

arXiv 2012.03844 ↗First posted 7 Dec 2020math.OCcited by 4

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Dec 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2024: 3; 2025: 1.

4 papers.