scientific article; zbMATH DE number 1301900
From MaRDI portal
Publication:4247128
zbMath0927.65077MaRDI QIDQ4247128
Carl. T. Kelley, David M. Bortz
Publication date: 14 December 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
performancemultidirectional searchsimplex gradientnoisy optimization problemsimplicit filtering methods
Related Items (14)
Full-low evaluation methods for derivative-free optimization ⋮ Theoretical connections between optimization algorithms based on an approximate gradient ⋮ A derivative-free approximate gradient sampling algorithm for finite minimax problems ⋮ Efficient calculation of regular simplex gradients ⋮ Nonsmooth spectral gradient methods for unconstrained optimization ⋮ Ensemble-Based Gradient Inference for Particle Methods in Optimization and Sampling ⋮ Geometry of interpolation sets in derivative free optimization ⋮ Solving nonlinear programming problems with noisy function values and noisy gradients ⋮ Generating set search using simplex gradients for bound-constrained black-box optimization ⋮ A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations ⋮ Derivative-free optimization methods ⋮ Approximating the diagonal of a Hessian: which sample set of points should be used ⋮ Calculus Identities for Generalized Simplex Gradients: Rules and Applications ⋮ The calculus of simplex gradients
Uses Software
This page was built for publication:
