Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates
From MaRDI portal
Publication:6353282
DOI10.1007/S10107-022-01787-7arXiv2011.04225MaRDI QIDQ6353282FDOQ6353282
Authors: Kwassi Joseph Dzahini, Michael Kokkolaras, Sébastien Le Digabel 
Publication date: 9 November 2020
Abstract: This work introduces the StoMADS-PB algorithm for constrained stochastic blackbox optimization, which is an extension of the mesh adaptive direct-search (MADS) method originally developed for deterministic blackbox optimization under general constraints. The values of the objective and constraint functions are provided by a noisy blackbox, i.e., they can only be computed with random noise whose distribution is unknown. As in MADS, constraint violations are aggregated into a single constraint violation function. Since all functions values are numerically unavailable, StoMADS-PB uses estimates and introduces so-called probabilistic bounds for the violation. Such estimates and bounds obtained from stochastic observations are required to be accurate and reliable with high but fixed probabilities. The proposed method, which allows intermediate infeasible iterates, accepts new points using sufficient decrease conditions and imposing a threshold on the probabilistic bounds. Using Clarke nonsmooth calculus and martingale theory, Clarke stationarity convergence results for the objective and the violation function are derived with probability one.
Nonlinear programming (90C30) Stochastic programming (90C15) Derivative-free methods and methods using generalized derivatives (90C56)
This page was built for publication: Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6353282)
