Is "ternary search" an appropriate term for the algorithm that optimizes a unimodal function on a real interval? Suppose that I want to optimize a unimodal function defined on some real interval.  I can use the well-known algorithm as described in Wikipedia under the name of ternary search.

In case of the algorithm that repeatedly halving intervals, it is common to reserve the term binary search for discrete problems and to use the term bisection method otherwise.  Extrapolating this convention, I suspect that the term trisection method might apply to the algorithm that solves my problem.

My question is whether it is common among academics, and is safe to use in, e.g., senior theses, to apply the term ternary search even if the algorithm is applied to a continuous problem.  I need a reputable source for this.  I'm also interested whether the term trisection method actually exists.
The word "bitonic search" can probably refer to this concept. See this book and these lecture notes for instance.