Pages that link to "Item:Q2028452"
From MaRDI portal
The following pages link to Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates (Q2028452):
Displaying 16 items.
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm (Q1653265) (← links)
- A zeroth order method for stochastic weakly convex optimization (Q2057220) (← links)
- Expected complexity analysis of stochastic direct-search (Q2070336) (← links)
- Iteratively sampling scheme for stochastic optimization with variable number sample path (Q2157906) (← links)
- Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates (Q2687061) (← links)
- Generating poll directions for mesh adaptive direct search with realizations of a uniformly distributed random orthogonal matrix (Q2836067) (← links)
- Algorithm 909 (Q2989131) (← links)
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization (Q4924108) (← links)
- Optimization of Stochastic Blackboxes with Adaptive Precision (Q5020850) (← links)
- TREGO: a trust-region framework for efficient global optimization (Q6102171) (← links)
- Two decades of blackbox optimization applications (Q6114909) (← links)
- Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization (Q6175706) (← links)
- Stochastic trust-region and direct-search methods: a weak tail bound condition and reduced sample sizing (Q6561380) (← links)
- Stochastic trust-region algorithm in random subspaces with convergence and expected complexity analyses (Q6580002) (← links)
- Worst case complexity bounds for linesearch-type derivative-free algorithms (Q6636792) (← links)
- Stochastic zeroth order descent with structured directions (Q6642789) (← links)
