Optimization of stochastic blackboxes with adaptive precision
From MaRDI portal
Abstract: In derivative-free and blackbox optimization, the objective function is often evaluated through the execution of a computer program seen as a blackbox. It can be noisy, in the sense that its outputs are contaminated by random errors. Sometimes, the source of these errors is identified and controllable, in the sense that it is possible to reduce the standard deviation of the stochastic noise it generates. A common strategy to deal with such a situation is to monotonically diminish this standard deviation, to asymptotically make it converge to zero and ensure convergence of algorithms because the noise is dismantled. This work presents MpMads, an algorithm which follows this approach. However, in practice a reduction of the standard deviation increases the computation time, and makes the optimization process long. Therefore, a second algorithm called DpMads is introduced to explore another strategy, which does not force the standard deviation to monotonically diminish. Although these strategies are proved to be theoretically equivalents, tests on analytical problems and an industrial blackbox are presented to illustrate practical differences.
Recommendations
- Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
- Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates
- Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
- A direct search algorithm for optimization with noisy function evaluations
Cites work
- A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging
- A direct search algorithm for optimization with noisy function evaluations
- A progressive barrier for derivative-free nonlinear programming
- A Simplex Method for Function Minimization
- A smoothing direct search method for Monte Carlo-based bound constrained composite nonsmooth optimization
- A stochastic line search method with expected complexity analysis
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- ASTRO-DF: a class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- Best practices for comparing optimization algorithms
- Derivative-free and blackbox optimization
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- Efficient global optimization of expensive black-box functions
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- Improving direct search algorithms by multilevel optimization techniques
- Introduction to Derivative-Free Optimization
- Introduction to the Theory of Nonlinear Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- On the Convergence of Pattern Search Algorithms
- Optimization with hidden constraints and embedded Monte Carlo computations
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Precision Control for Generalized Pattern Search Algorithms with Adaptive Precision Function Evaluations
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
- Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
- Stochastic Nelder-Mead simplex method -- a new globally convergent direct search method for simulation optimization
- Surrogate-assisted bounding-box approach for optimization problems with tunable objectives fidelity
- The mesh adaptive direct search algorithm for granular and discrete variables
- Variable-number sample-path optimization
Cited in
(7)- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
- Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
- A decomposition method by interaction prediction for the optimization of maintenance scheduling
- Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates
- Direct-search methods in the year 2025: theoretical guarantees and algorithmic paradigms
- Inter-DS: a cost saving algorithm for expensive constrained multi-fidelity blackbox optimization
- An adaptive strategy on the error of the objective functions for uncertainty-based derivative-free optimization
This page was built for publication: Optimization of stochastic blackboxes with adaptive precision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020850)
