Pages that link to "Item:Q4634094"
From MaRDI portal
The following pages link to Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods (Q4634094):
Displaying 39 items.
- Stochastic derivative-free optimization using a trust region framework (Q301671) (← links)
- Optimising noisy objective functions (Q813361) (← links)
- A discussion on variational analysis in derivative-free optimization (Q829491) (← links)
- Simple and cumulative regret for continuous noisy optimization (Q905845) (← links)
- An accelerated directional derivative method for smooth stochastic convex optimization (Q2029381) (← links)
- A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization (Q2143221) (← links)
- How to catch a lion in the desert: on the solution of the coverage directed generation (CDG) problem (Q2245689) (← links)
- Calibration by optimization without using derivatives (Q2358082) (← links)
- Complex-step derivative approximation in noisy environment (Q2402384) (← links)
- Gradient estimation schemes for noisy functions (Q2583201) (← links)
- A mixed finite differences scheme for gradient approximation (Q2671431) (← links)
- Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in \(\mathrm{IR}^n\) (Q2687735) (← links)
- Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition (Q2696921) (← links)
- Non-intrusive termination of noisy optimization (Q2867421) (← links)
- A Derivative-Free Trust-Region Algorithm for the Optimization of Functions Smoothed via Gaussian Convolution Using Adaptive Multiple Importance Sampling (Q4641668) (← links)
- A grid algorithm for bound constrained optimization of noisy functions (Q4852685) (← links)
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise (Q4997171) (← links)
- Optimization of Stochastic Blackboxes with Adaptive Precision (Q5020850) (← links)
- A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization (Q5026838) (← links)
- An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization (Q5081777) (← links)
- Adaptive Finite-Difference Interval Estimation for Noisy Derivative-Free Optimization (Q5095497) (← links)
- Analysis of the BFGS Method with Errors (Q5210518) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- On the numerical performance of finite-difference-based methods for derivative-free optimization (Q5882235) (← links)
- Full-low evaluation methods for derivative-free optimization (Q5882241) (← links)
- Zeroth-order optimization with orthogonal random directions (Q6038668) (← links)
- A trust region method for noisy unconstrained optimization (Q6052069) (← links)
- Latent Gaussian Count Time Series (Q6107233) (← links)
- Quadratic regularization methods with finite-difference gradient approximations (Q6175465) (← links)
- Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization (Q6175706) (← links)
- Constrained Optimization in the Presence of Noise (Q6176426) (← links)
- Global solutions to nonconvex problems by evolution of Hamilton-Jacobi PDEs (Q6575280) (← links)
- Small errors in random zeroth-order optimization are imaginary (Q6580001) (← links)
- New subspace method for unconstrained derivative-free optimization (Q6604149) (← links)
- First- and second-order high probability complexity bounds for trust-region methods with noisy oracles (Q6608030) (← links)
- Full-low evaluation methods for bound and linearly constrained derivative-free optimization (Q6624429) (← links)
- Effective matrix adaptation strategy for noisy derivative-free optimization (Q6645950) (← links)
- A sequential quadratic programming method with high-probability complexity bounds for nonlinear equality-constrained stochastic optimization (Q6663117) (← links)
