## Newton-Raphson and Golden section search

Hi. Im stuck on this problem:

Consider the function:

$f(x) = x+2$ if $x \le 2$
$f(x) = 8-x$ $otherwise
$

Discuss the applicability of Newton-Raphson and golden section search: will they successfully approximate the minimum in $[-3,5]$ to within a pre-specified tolerance?

I am thinking no? because there are no such minimium for the graph, since it is totally unbounded. Am I on the right track? How can I explain this in terms of those methods mentioned in the question?

Thanks.