A Unified Efficient Gradient-Based Heuristic For Box-Constrained Expectation-Related and Risk-Averse Stochastic Optimization Problems
Abstract
This paper presents a new algorithm addressing the problem of stochastic optimization where the cost function depends on a vector of uncertain parameters with known statistics. The algorithm is parameterized so as to address various stochastic formulations spanning from Expectation-focused to Value-at-Risk (VaR) as well as Conditional-Value-at-Risk (CVaR)-focused formulations. The algorithm leverages a recently proposed gradient-based Search & Accelerate algorithm which is originally dedicated to deterministic optimization problems. The approach is based on a sequence of warm-started solutions of instances of the problem. These solutions together with a samples of other solutions belonging to the convex hull of the first ones constitute the set of admissible candidates. Among this discrete set of candidates, the optimal solution is selected with regards to a sample-based approximation of the targeted criterion. The relevance of the algorithm and its efficiency are discussed and shown using a tailored illustrative example.
Related
- Stochastic Augmented Lagrangian Framework with Second-Order Convergence Guarantees for Nonconvex Expectation-Constrained Optimization
- A Stochastic Riemannian Alternating Descent Ascent Method for Nonsmooth Composite Expectation Optimization on Riemannian Manifolds
- A Stochastic Proximal-Gradient Method for Regularized Generally Constrained Continuous Optimization
- Online Feedback Optimization for Constrained Stochastic Problems with Decision-Dependent Distributions
- Projection-Free Multi-level Algorithms for Stochastic Constrained Compositional Optimization
BibTeX
@misc{alamir2026unified,
title = {{A Unified Efficient Gradient-Based Heuristic For Box-Constrained Expectation-Related and Risk-Averse Stochastic Optimization Problems}},
author = {Mazen Alamir},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.07427},
eprint = {2609.07427},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.07427},
}
RIS
TY - UNPB
TI - A Unified Efficient Gradient-Based Heuristic For Box-Constrained Expectation-Related and Risk-Averse Stochastic Optimization Problems
AU - Mazen Alamir
PY - 2026
DA - 2026/09/07
PB - arXiv
DO - 10.48550/arxiv.2609.07427
UR - https://arxiv.org/abs/2609.07427
AB - This paper presents a new algorithm addressing the problem of stochastic optimization where the cost function depends on a vector of uncertain parameters with known statistics. The algorithm is parameterized so as to address various stochastic formulations spanning from Expectation-focused to Value-at-Risk (VaR) as well as Conditional-Value-at-Risk (CVaR)-focused formulations. The algorithm leverages a recently proposed gradient-based Search & Accelerate algorithm which is originally dedicated to deterministic optimization problems. The approach is based on a sequence of warm-started solutions of instances of the problem. These solutions together with a samples of other solutions belonging to the convex hull of the first ones constitute the set of admissible candidates. Among this discrete set of candidates, the optimal solution is selected with regards to a sample-based approximation of the targeted criterion. The relevance of the algorithm and its efficiency are discussed and shown using a tailored illustrative example.
ER -