Inter-DS: a cost saving algorithm for expensive constrained multi-fidelity blackbox optimization
From MaRDI portal
Cites work
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- A progressive barrier for derivative-free nonlinear programming
- A Simplex Method for Function Minimization
- A taxonomy of constraints in black-box simulation-based optimization
- Algorithm 856
- Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm
- Bayesian optimization for policy search via online-offline experimentation
- Binary, unrelaxable and hidden constraints in blackbox optimization
- Derivative-free and blackbox optimization
- Expected complexity analysis of stochastic direct-search
- Globalization strategies for mesh adaptive direct search
- GOSAC: global optimization with surrogate approximation of constraints
- Hierarchically constrained blackbox optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Nonlinear programming without a penalty function.
- Optimization of stochastic blackboxes with adaptive precision
- Parallel metaheuristics: recent advances and new trends
- 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
- Survey of multifidelity methods in uncertainty propagation, inference, and optimization
- Two decades of blackbox optimization applications
This page was built for publication: Inter-DS: a cost saving algorithm for expensive constrained multi-fidelity blackbox optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7006141)