Let $f(t)$ be a function from $(0,1)$ to $\mathbb R$. If $f$ is strictly convex, then finding the minimizer is an easy task. For example, newton's method would be able to do the job.

However, if my function is not convex, but more like the following (please forgive my poor drawing skill...)

That is， the function is "almost" convex but with small perturbation. Then, is there an efficient algorithm which can find an "good enough" minimizer?

PS: the existence of minimizer of $f(t)$ is assumed.

any ideas or references would be really welcome.

Thank you!

interval methodswhich (as long as the bounds are good) often allow for relatively efficient and robust pruning. $\endgroup$ – Steven Stadnicki Sep 22 '16 at 23:55