Pages that link to "Item:Q301671"

The following pages link to Stochastic derivative-free optimization using a trust region framework (Q301671):

Displaying 21 items.

• Survey of derivative-free optimization (Q827577) (← links)
• Stochastic optimization using a trust-region method and random models (Q1646570) (← links)
• Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm (Q1653265) (← links)
• Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates (Q2028452) (← links)
• A zeroth order method for stochastic weakly convex optimization (Q2057220) (← links)
• Expected complexity analysis of stochastic direct-search (Q2070336) (← links)
• Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970) (← links)
• Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates (Q2687061) (← links)
• ASTRO-DF: A Class of Adaptive Sampling Trust-Region Algorithms for Derivative-Free Stochastic Optimization (Q4561224) (← links)
• A Derivative-Free Trust-Region Algorithm for the Optimization of Functions Smoothed via Gaussian Convolution Using Adaptive Multiple Importance Sampling (Q4641668) (← links)
• A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results (Q5075237) (← links)
• Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models (Q5079553) (← links)
• Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty (Q5085157) (← links)
• Surrogate-Based Promising Area Search for Lipschitz Continuous Simulation Optimization (Q5137952) (← links)
• Convergence of Newton-MR under Inexact Hessian Information (Q5148404) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• Manifold Sampling for $\ell_1$ Nonconvex Optimization (Q5506685) (← 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)
• Worst case complexity bounds for linesearch-type derivative-free algorithms (Q6636792) (← links)
• An empirical quantile estimation approach for chance-constrained nonlinear optimization problems (Q6636810) (← links)