The calculus of simplex gradients

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Optimization Letters

• Publication date

  2014-10-17

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s11590-014-0815-x
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An Initialization Strategy for High-Dimensional Surrogate-Based Expensive Black-Box Optimization

  2013influential reference
• Introduction to derivative-free optimization

  2010influential reference
• Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization

  2010cited by this paper
• Benchmarking Derivative-Free Optimization Algorithms

  2009cited by this paper
• Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation

  2008cited by this paper
• Using simplex gradients of nonsmooth functions in direct search methods

  2008influential reference
• Geometry of interpolation sets in derivative free optimization

  2007cited by this paper
• Using Sampling and Simplex Derivatives in Pattern Search Methods

  2007influential reference
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization

  2006cited by this paper
• The Simplex Gradient and Noisy Optimization Problems

  1998cited by this paper
• ON THE CONVERGENCE OF PATTERN SEARCH ALGORITHMS

  1997cited by this paper

• Relationships between full-space and subspace quadratic interpolation models and simplex derivatives

  2026cites this paper
• A general framework for floating point error analysis of first-order simplex derivatives

  2025cites this paper
• Interpolation-Based Gradient-Error Bounds for Use in Derivative-Free Optimization of Noisy Functions

  2025cites this paper
• Multi-Source Encapsulation With Guaranteed Convergence Using Minimalist Robots

  2024cites this paper
• Leveraging Interpolation Models and Error Bounds for Verifiable Scientific Machine Learning

  2024cites this paper
• An approximating state-dependent control method based on modified pattern search optimization for nonlinear optimal control problem

  2024cites this paper
• A general framework for floating point error analysis of simplex derivatives

  2024cites this paper
• Linear Convergence of the Derivative-Free Proximal Bundle Method on Convex Nonsmooth Functions, with Application to the Derivative-Free VU\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usep

  2024cites this paper
• About the Performance of a Calculus-Based Approach to Building Model Functions in a Derivative-Free Trust-Region Algorithm

  2023cites this paper
• Using generalized simplex methods to approximate derivatives

  2023cites this paper
• Curvature Aligned Simplex Gradient: Principled Sample Set Construction For Numerical Differentiation

  2023cites this paper
• Adapting the centred simplex gradient to compensate for misaligned sample points

  2023cites this paper
• The Error in Multivariate Linear Extrapolation with Applications to Derivative-Free Optimization

  2023cites this paper
• Using orthogonally structured positive bases for constructing positive k-spanning sets with cosine measure guarantees

  2023cites this paper
• A matrix algebra approach to approximate Hessians

  2023influential citation
• A hybrid direct search and projected simplex gradient method for convex constrained minimization

  2023cites this paper
• Gradient free cooperative seeking of a moving source

  2022cites this paper
• Ensemble-based gradient inference for particle methods in optimization and sampling

  2022influential citation
• Error Analysis of Surrogate Models Constructed through Operations on Sub-models

  2021cites this paper
• Approximating the diagonal of a Hessian: which sample set of points should be used

  2021cites this paper
• Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in R

  2021cites this paper
• Limiting Behaviour of the Generalized Simplex Gradient as the Number of Points Tends to Infinity on a Fixed Shape in IR^n

  2021cites this paper
• A Discussion on Variational Analysis in Derivative-Free Optimization

  2020cites this paper
• Error bounds for overdetermined and underdetermined generalized centred simplex gradients

  2020cites this paper
• Algorithm 1012

  2020cites this paper
• Hessian approximations.

  2020cites this paper
• Mathematical Software for Multiobjective Optimization Problems

  2020cites this paper
• Calculus Identities for Generalized Simplex Gradients: Rules and Applications

  2020cites this paper
• Derivative-free optimization methods

  2019cites this paper
• Model-Based Methods in Derivative-Free Nonsmooth Optimization

  2018cites this paper
• Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers

  2018cites this paper
• Introduction: Tools and Challenges in Derivative-Free and Blackbox Optimization

  2017cites this paper
• Nonsmooth spectral gradient methods for unconstrained optimization

  2017cites this paper
• Model-Based Trust Region

  2017cites this paper
• Efficient calculation of regular simplex gradients

  2017cites this paper
• Compositions of convex functions and fully linear models

  2016cites this paper
• Global optimization using q-gradients

  2016cites this paper