Hi. Im stuck on this problem:
Consider the function:
Discuss the applicability of Newton-Raphson and golden section search: will they successfully approximate the minimum in 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?