Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in \(\mathrm{IR}^n\)
From MaRDI portal
Publication:2687735
DOI10.1007/s11228-023-00664-5OpenAlexW4317493516MaRDI QIDQ2687735
Gabriel Jarry-Bolduc, Warren L. Hare, Chayne Planiden
Publication date: 7 March 2023
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.00748
derivative-free optimizationapproximate derivatives(generalized) simplex gradienterror bound ad infinitum
Mathematical programming (90Cxx) Operator theory (47-XX) Numerical analysis (65-XX) Approximations and expansions (41Axx)
Uses Software
Cites Work
- On the construction of quadratic models for derivative-free trust-region algorithms
- An inexact algorithm for composite nondifferentiable optimization
- Generalized inverses. Theory and applications.
- Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\)
- The calculus of simplex gradients
- Geometry of interpolation sets in derivative free optimization
- How to Integrate a Polynomial over a Sphere
- A derivative-free comirror algorithm for convex optimization
- Introduction to Derivative-Free Optimization
- Variational Analysis
- Derivative-Free and Blackbox Optimization
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- A Derivative-Free Trust-Region Algorithm for the Optimization of Functions Smoothed via Gaussian Convolution Using Adaptive Multiple Importance Sampling
- Error bounds for overdetermined and underdetermined generalized centred simplex gradients
- An Inverse Matrix Adjustment Arising in Discriminant Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
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\)
