Abstract

Simplex gradients, essentially the gradient of a linear approximation, are a popular tool in derivative-free optimization (DFO). In 2015, a product rule, a quotient rule, and a sum rule for simplex gradients were introduced by Regis [Optim. Lett., 9 (2015), pp. 845--865]. Unfortunately, those calculus rules only work under a restrictive set of assumptions. The purpose of this paper is to provide new calculus rules that work in a wider setting. The rules place minimal assumptions on the functions involved and the interpolation sets. The rules further lead to an alternative approach to gradient approximation in situations where the rules could be applied. We analyze the new approach, provide error bounds, and include some preliminary testing on numerical stability and accuracy.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call