Abstract:
In this note we describe a sequential algorithm for the computation with specified accuracy on a segment of the largest value of a twice-differentiable function. The algorithm described does not require the computation of the values of the derivative.
Citation:
G. S. Ganshin, “Simplest sequential search algorithm for the largest value of a twice-differentiable function”, Mat. Zametki, 19:6 (1976), 871–872; Math. Notes, 19:6 (1976), 508–509