Pages that link to "Item:Q2070336"
From MaRDI portal
The following pages link to Expected complexity analysis of stochastic direct-search (Q2070336):
Displaying 8 items.
- Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates (Q2028452) (← links)
- A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning (Q2163207) (← links)
- Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates (Q2687061) (← links)
- Maximizing Complex Likelihoods via Directed Stochastic Searching Algorithm (Q5172795) (← links)
- Direct Search Based on Probabilistic Descent (Q5502242) (← 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)
- Stochastic zeroth order descent with structured directions (Q6642789) (← links)