Quantifying uncertainty with ensembles of surrogates for blackbox optimization (Q2162525)

scientific article; zbMATH DE number 7569391

Language	Label	Description	Also known as
default for all languages	No label defined
English	Quantifying uncertainty with ensembles of surrogates for blackbox optimization	scientific article; zbMATH DE number 7569391

Statements

instance of

scholarly article

0 references

title

Quantifying uncertainty with ensembles of surrogates for blackbox optimization (English)

0 references

0 references

0 references

0 references

Computational Optimization and Applications

0 references

publication date

8 August 2022

0 references

full work available at URL

https://arxiv.org/abs/2107.04360

0 references

zbMATH Keywords

blackbox optimization

0 references

derivative-free optimization

0 references

ensembles of surrogates

0 references

mesh adaptive direct search

0 references

Bayesian optimization

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions

0 references

Convergence results for generalized pattern search algorithms are tight

0 references

Spent potliner treatment process optimization using a MADS algorithm

0 references

Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search

0 references

Dynamic improvements of static surrogates in direct search optimization

0 references

Mesh Adaptive Direct Search Algorithms for Constrained Optimization

0 references

A progressive barrier for derivative-free nonlinear programming

0 references

Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm

0 references

Derivative-free and blackbox optimization

0 references

Order-based error for managing ensembles of surrogates in mesh adaptive direct search

0 references

Algorithm 1027: <tt>NOMAD</tt> Version 4: Nonlinear Optimization with the MADS Algorithm

0 references

Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization

0 references

Global optimization of costly nonconvex functions using radial basis functions

0 references

Optimization of automotive valve train components with implicit filtering

0 references

Optimization and nonsmooth analysis

0 references

Use of quadratic models with mesh-adaptive direct search for constrained black box optimization

0 references

Introduction to Derivative-Free Optimization

0 references

Q4524222

0 references

Incorporating minimum Frobenius norm models in direct search

0 references

Theory of Positive Linear Dependence

0 references

A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization

0 references

The mesh adaptive direct search algorithm with treed Gaussian process surrogates

0 references

Test examples for nonlinear programming codes

0 references

A taxonomy of global optimization methods based on response surfaces

0 references

Efficient global optimization of expensive black-box functions

0 references

Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition

0 references

Sequential approximate optimization using radial basis function network for engineering optimization

0 references

Derivative-free optimization methods

0 references

Trailing-edge noise reduction using derivative-free optimization and large-eddy simulation

0 references

A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code

0 references

Q4177353

0 references

Benchmarking Derivative-Free Optimization Algorithms

0 references

An algorithmic framework for the optimization of computationally expensive bi-fidelity black-box problems

0 references

Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints

0 references

Surrogate optimization of deep neural networks for groundwater predictions

0 references

Mixture surrogate models based on Dempster-Shafer theory for global optimization problems

0 references

Gaussian processes for machine learning.

0 references

Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions

0 references

Constrained global optimization of expensive black box functions using radial basis functions

0 references

Design and analysis of computer experiments. With comments and a rejoinder by the authors

0 references

Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting

0 references

Dynamic trees for learning and design

0 references

Locally weighted regression models for surrogate-assisted design optimization

0 references

Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization

0 references

On the Convergence of Pattern Search Algorithms

0 references

On the construction of quadratic models for derivative-free trust-region algorithms

0 references

Efficient global optimization algorithm assisted by multiple surrogate techniques

0 references

Surrogate‐based methods for black‐box optimization

0 references

ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions

0 references

Global convergence of radial basis function trust region derivative-free algorithms

0 references

Identifiers

zbMATH Open document ID

1496.90091

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S10589-022-00381-Z

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2162525