Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in IR^n
From MaRDI portal
Publication:2687735
Recommendations
- Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\)
- Error bounds for overdetermined and underdetermined generalized centred simplex gradients
- Gradient Convergence in Gradient methods with Errors
- Asymptotic error for the global maximum of functions in s dimensions
- The calculus of simplex gradients
Cites work
- A derivative-free comirror algorithm for convex optimization
- A derivative-free trust-region algorithm for the optimization of functions smoothed via Gaussian convolution using adaptive multiple importance sampling
- An inexact algorithm for composite nondifferentiable optimization
- An Inverse Matrix Adjustment Arising in Discriminant Analysis
- Derivative-free and blackbox optimization
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- Error bounds for overdetermined and underdetermined generalized centred simplex gradients
- Generalized inverses. Theory and applications.
- Geometry of interpolation sets in derivative free optimization
- How to Integrate a Polynomial over a Sphere
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 3441507 (Why is no real title available?)
- scientific article; zbMATH DE number 3421851 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\)
- On the construction of quadratic models for derivative-free trust-region algorithms
- The calculus of simplex gradients
- Variational Analysis
Cited in
(4)- Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\)
- Error bounds for overdetermined and underdetermined generalized centred simplex gradients
- Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in R^n
- Adapting the centred simplex gradient to compensate for misaligned sample points
This page was built for publication: Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in \(\mathrm{IR}^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2687735)
