Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Approximating the diagonal of a Hessian: which sample set of points should be used (2104.11821v1)

Published 23 Apr 2021 in math.NA, cs.NA, and math.OC

Abstract: An explicit formula to approximate the diagonal entries of the Hessian is introduced. When the derivative-free technique called \emph{generalized centered simplex gradient} is used to approximate the gradient, then the formula can be computed for only one additional function evaluation. An error bound is introduced and provides information on the form of the sample set of points that should be used to approximate the diagonal of a Hessian. If the sample set of points is built in a specific manner, it is shown that the technique is $\mathcal{O}(\Delta_S2)$ accurate approximation of the diagonal entries of the Hessian where $\Delta_S$ is the radius of the sample set.

Citations (3)

Summary

We haven't generated a summary for this paper yet.