The following pages link to (Q4247128):
Displayed 14 items.
- A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← links)
- Solving nonlinear programming problems with noisy function values and noisy gradients (Q700766) (← links)
- Theoretical connections between optimization algorithms based on an approximate gradient (Q1663476) (← links)
- Nonsmooth spectral gradient methods for unconstrained optimization (Q1688945) (← links)
- Generating set search using simplex gradients for bound-constrained black-box optimization (Q2028453) (← links)
- Approximating the diagonal of a Hessian: which sample set of points should be used (Q2084264) (← links)
- The calculus of simplex gradients (Q2355312) (← links)
- Efficient calculation of regular simplex gradients (Q2419521) (← links)
- Geometry of interpolation sets in derivative free optimization (Q2467163) (← links)
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations (Q2515062) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Calculus Identities for Generalized Simplex Gradients: Rules and Applications (Q5853722) (← links)
- Full-low evaluation methods for derivative-free optimization (Q5882241) (← links)
- Ensemble-Based Gradient Inference for Particle Methods in Optimization and Sampling (Q6177924) (← links)